./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.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/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/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 e4d1760c3f63950e961525df0d726cb05fa47146 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:26:30,718 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:26:30,720 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:26:30,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:26:30,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:26:30,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:26:30,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:26:30,745 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:26:30,749 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:26:30,754 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:26:30,755 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:26:30,756 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:26:30,756 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:26:30,758 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:26:30,759 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:26:30,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:26:30,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:26:30,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:26:30,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:26:30,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:26:30,770 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:26:30,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:26:30,774 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:26:30,774 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:26:30,777 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:26:30,777 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:26:30,778 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:26:30,779 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:26:30,779 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:26:30,780 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:26:30,780 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:26:30,781 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:26:30,781 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:26:30,782 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:26:30,783 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:26:30,784 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:26:30,784 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:26:30,785 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:26:30,785 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:26:30,786 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:26:30,786 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:26:30,787 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 21:26:30,811 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:26:30,811 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:26:30,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:26:30,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:26:30,812 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:26:30,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:26:30,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:26:30,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:26:30,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:26:30,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:26:30,814 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 21:26:30,814 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 21:26:30,814 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 21:26:30,814 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:26:30,815 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:26:30,815 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:26:30,815 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 21:26:30,815 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:26:30,815 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:26:30,816 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 21:26:30,816 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 21:26:30,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:26:30,816 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:26:30,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 21:26:30,817 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 21:26:30,817 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:26:30,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 21:26:30,827 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 21:26:30,827 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/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 -> e4d1760c3f63950e961525df0d726cb05fa47146 [2019-11-15 21:26:30,862 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:26:30,874 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:26:30,877 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:26:30,878 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:26:30,879 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:26:30,881 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-15 21:26:30,937 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/data/d9bfd7284/77a1123377f240a19544b84bedcfd613/FLAG8c825d5b6 [2019-11-15 21:26:31,411 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:26:31,411 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2019-11-15 21:26:31,428 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/data/d9bfd7284/77a1123377f240a19544b84bedcfd613/FLAG8c825d5b6 [2019-11-15 21:26:31,753 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/data/d9bfd7284/77a1123377f240a19544b84bedcfd613 [2019-11-15 21:26:31,756 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:26:31,757 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:26:31,758 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:26:31,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:26:31,762 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:26:31,763 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:26:31" (1/1) ... [2019-11-15 21:26:31,765 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df1a1b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:31, skipping insertion in model container [2019-11-15 21:26:31,765 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:26:31" (1/1) ... [2019-11-15 21:26:31,775 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:26:31,827 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:26:32,158 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:26:32,166 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:26:32,259 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:26:32,284 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:26:32,285 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32 WrapperNode [2019-11-15 21:26:32,285 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:26:32,286 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:26:32,286 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:26:32,286 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:26:32,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,314 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,370 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:26:32,371 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:26:32,371 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:26:32,371 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:26:32,380 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,380 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,387 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,387 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,418 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,435 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... [2019-11-15 21:26:32,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:26:32,459 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:26:32,459 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:26:32,459 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:26:32,460 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 21:26:32,540 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:26:32,540 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:26:32,794 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,804 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,811 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,835 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,838 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,841 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,844 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,848 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,857 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,861 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,868 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:32,874 WARN L732 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-15 21:26:33,858 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2019-11-15 21:26:33,858 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2019-11-15 21:26:33,858 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2019-11-15 21:26:33,859 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2019-11-15 21:26:33,859 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2019-11-15 21:26:33,859 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2019-11-15 21:26:33,859 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2019-11-15 21:26:33,859 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2019-11-15 21:26:33,860 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2019-11-15 21:26:33,860 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2019-11-15 21:26:33,860 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-15 21:26:33,860 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-15 21:26:33,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2019-11-15 21:26:33,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2019-11-15 21:26:33,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2019-11-15 21:26:33,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2019-11-15 21:26:33,861 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2019-11-15 21:26:33,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2019-11-15 21:26:33,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2019-11-15 21:26:33,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2019-11-15 21:26:33,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-11-15 21:26:33,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-11-15 21:26:33,862 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2019-11-15 21:26:33,863 INFO L685 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2019-11-15 21:26:33,864 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:26:33,864 INFO L284 CfgBuilder]: Removed 152 assume(true) statements. [2019-11-15 21:26:33,865 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:26:33 BoogieIcfgContainer [2019-11-15 21:26:33,866 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:26:33,866 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 21:26:33,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 21:26:33,869 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 21:26:33,870 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 09:26:31" (1/3) ... [2019-11-15 21:26:33,870 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bc3654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:26:33, skipping insertion in model container [2019-11-15 21:26:33,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:26:32" (2/3) ... [2019-11-15 21:26:33,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39bc3654 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 09:26:33, skipping insertion in model container [2019-11-15 21:26:33,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:26:33" (3/3) ... [2019-11-15 21:26:33,873 INFO L109 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2019-11-15 21:26:33,881 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 21:26:33,888 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 29 error locations. [2019-11-15 21:26:33,898 INFO L249 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2019-11-15 21:26:33,923 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 21:26:33,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 21:26:33,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 21:26:33,923 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:26:33,924 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:26:33,924 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 21:26:33,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:26:33,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 21:26:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states. [2019-11-15 21:26:33,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-15 21:26:33,952 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:33,953 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:33,956 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:33,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:33,961 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2019-11-15 21:26:33,968 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:33,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032337156] [2019-11-15 21:26:33,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:33,969 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:33,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:34,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:34,115 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032337156] [2019-11-15 21:26:34,116 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:34,116 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:34,116 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432697267] [2019-11-15 21:26:34,120 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:34,120 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:34,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:34,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:34,134 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 3 states. [2019-11-15 21:26:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:34,250 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2019-11-15 21:26:34,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:34,252 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-11-15 21:26:34,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:34,266 INFO L225 Difference]: With dead ends: 574 [2019-11-15 21:26:34,266 INFO L226 Difference]: Without dead ends: 320 [2019-11-15 21:26:34,272 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-11-15 21:26:34,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2019-11-15 21:26:34,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2019-11-15 21:26:34,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2019-11-15 21:26:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 438 transitions. [2019-11-15 21:26:34,360 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 438 transitions. Word has length 11 [2019-11-15 21:26:34,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:34,360 INFO L462 AbstractCegarLoop]: Abstraction has 320 states and 438 transitions. [2019-11-15 21:26:34,360 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:34,360 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 438 transitions. [2019-11-15 21:26:34,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-15 21:26:34,361 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:34,362 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:34,362 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:34,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:34,363 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2019-11-15 21:26:34,363 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:34,363 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [808594989] [2019-11-15 21:26:34,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:34,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:34,364 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:34,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:34,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [808594989] [2019-11-15 21:26:34,465 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:34,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:34,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735737033] [2019-11-15 21:26:34,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:34,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:34,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:34,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:34,469 INFO L87 Difference]: Start difference. First operand 320 states and 438 transitions. Second operand 3 states. [2019-11-15 21:26:34,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:34,745 INFO L93 Difference]: Finished difference Result 421 states and 565 transitions. [2019-11-15 21:26:34,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:34,748 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-15 21:26:34,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:34,751 INFO L225 Difference]: With dead ends: 421 [2019-11-15 21:26:34,751 INFO L226 Difference]: Without dead ends: 360 [2019-11-15 21:26:34,752 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-11-15 21:26:34,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2019-11-15 21:26:34,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 347. [2019-11-15 21:26:34,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2019-11-15 21:26:34,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 475 transitions. [2019-11-15 21:26:34,775 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 475 transitions. Word has length 13 [2019-11-15 21:26:34,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:34,775 INFO L462 AbstractCegarLoop]: Abstraction has 347 states and 475 transitions. [2019-11-15 21:26:34,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 475 transitions. [2019-11-15 21:26:34,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-15 21:26:34,777 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:34,777 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:34,778 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:34,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:34,778 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2019-11-15 21:26:34,778 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:34,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247745727] [2019-11-15 21:26:34,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:34,779 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:34,779 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:34,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:34,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:34,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247745727] [2019-11-15 21:26:34,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:34,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:34,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347306719] [2019-11-15 21:26:34,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:34,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:34,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:34,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:34,841 INFO L87 Difference]: Start difference. First operand 347 states and 475 transitions. Second operand 3 states. [2019-11-15 21:26:34,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:34,897 INFO L93 Difference]: Finished difference Result 542 states and 723 transitions. [2019-11-15 21:26:34,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:34,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-15 21:26:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:34,900 INFO L225 Difference]: With dead ends: 542 [2019-11-15 21:26:34,901 INFO L226 Difference]: Without dead ends: 354 [2019-11-15 21:26:34,902 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-11-15 21:26:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2019-11-15 21:26:34,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 303. [2019-11-15 21:26:34,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2019-11-15 21:26:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2019-11-15 21:26:34,920 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 15 [2019-11-15 21:26:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:34,920 INFO L462 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2019-11-15 21:26:34,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2019-11-15 21:26:34,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-15 21:26:34,923 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:34,923 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] [2019-11-15 21:26:34,924 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:34,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:34,924 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2019-11-15 21:26:34,924 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:34,924 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305814961] [2019-11-15 21:26:34,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:34,925 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:34,925 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:34,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,010 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305814961] [2019-11-15 21:26:35,010 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,011 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:35,011 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213822236] [2019-11-15 21:26:35,011 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:35,011 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:35,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:35,012 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand 3 states. [2019-11-15 21:26:35,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,188 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2019-11-15 21:26:35,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:35,189 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 21 [2019-11-15 21:26:35,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,191 INFO L225 Difference]: With dead ends: 303 [2019-11-15 21:26:35,191 INFO L226 Difference]: Without dead ends: 289 [2019-11-15 21:26:35,192 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-11-15 21:26:35,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2019-11-15 21:26:35,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2019-11-15 21:26:35,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2019-11-15 21:26:35,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2019-11-15 21:26:35,209 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 21 [2019-11-15 21:26:35,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,209 INFO L462 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2019-11-15 21:26:35,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:35,210 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2019-11-15 21:26:35,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-15 21:26:35,213 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,213 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:35,214 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,214 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2019-11-15 21:26:35,214 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567706869] [2019-11-15 21:26:35,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,215 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,215 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:35,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567706869] [2019-11-15 21:26:35,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,297 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:35,297 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060093122] [2019-11-15 21:26:35,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:35,298 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:35,298 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand 3 states. [2019-11-15 21:26:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,327 INFO L93 Difference]: Finished difference Result 296 states and 413 transitions. [2019-11-15 21:26:35,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:35,328 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-15 21:26:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,328 INFO L225 Difference]: With dead ends: 296 [2019-11-15 21:26:35,329 INFO L226 Difference]: Without dead ends: 66 [2019-11-15 21:26:35,329 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-11-15 21:26:35,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-11-15 21:26:35,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2019-11-15 21:26:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-11-15 21:26:35,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 81 transitions. [2019-11-15 21:26:35,333 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 81 transitions. Word has length 26 [2019-11-15 21:26:35,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,334 INFO L462 AbstractCegarLoop]: Abstraction has 66 states and 81 transitions. [2019-11-15 21:26:35,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:35,334 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 81 transitions. [2019-11-15 21:26:35,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:26:35,335 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,335 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:35,336 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2019-11-15 21:26:35,337 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,337 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583443529] [2019-11-15 21:26:35,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,337 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:35,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,438 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583443529] [2019-11-15 21:26:35,438 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,439 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:35,439 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457584752] [2019-11-15 21:26:35,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:35,439 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:35,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:35,440 INFO L87 Difference]: Start difference. First operand 66 states and 81 transitions. Second operand 3 states. [2019-11-15 21:26:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,467 INFO L93 Difference]: Finished difference Result 86 states and 105 transitions. [2019-11-15 21:26:35,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:35,468 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:26:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,469 INFO L225 Difference]: With dead ends: 86 [2019-11-15 21:26:35,469 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 21:26:35,469 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-11-15 21:26:35,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 21:26:35,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-15 21:26:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 21:26:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 77 transitions. [2019-11-15 21:26:35,473 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 77 transitions. Word has length 27 [2019-11-15 21:26:35,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,473 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 77 transitions. [2019-11-15 21:26:35,473 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:35,474 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2019-11-15 21:26:35,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-15 21:26:35,475 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,475 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:26:35,475 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,476 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2019-11-15 21:26:35,476 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,476 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650045977] [2019-11-15 21:26:35,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,476 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,477 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:35,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650045977] [2019-11-15 21:26:35,541 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,542 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:35,542 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391949895] [2019-11-15 21:26:35,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:35,542 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:35,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:35,543 INFO L87 Difference]: Start difference. First operand 63 states and 77 transitions. Second operand 3 states. [2019-11-15 21:26:35,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,557 INFO L93 Difference]: Finished difference Result 90 states and 110 transitions. [2019-11-15 21:26:35,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:35,558 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-15 21:26:35,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,559 INFO L225 Difference]: With dead ends: 90 [2019-11-15 21:26:35,559 INFO L226 Difference]: Without dead ends: 63 [2019-11-15 21:26:35,559 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-11-15 21:26:35,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2019-11-15 21:26:35,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2019-11-15 21:26:35,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2019-11-15 21:26:35,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2019-11-15 21:26:35,563 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 27 [2019-11-15 21:26:35,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,563 INFO L462 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2019-11-15 21:26:35,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:35,564 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2019-11-15 21:26:35,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:26:35,565 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,565 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] [2019-11-15 21:26:35,567 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,568 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2019-11-15 21:26:35,568 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226859587] [2019-11-15 21:26:35,568 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,569 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:35,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,672 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226859587] [2019-11-15 21:26:35,672 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,672 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:35,672 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856739341] [2019-11-15 21:26:35,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:35,673 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:35,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:35,673 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand 5 states. [2019-11-15 21:26:35,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,735 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2019-11-15 21:26:35,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:35,737 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 21:26:35,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,738 INFO L225 Difference]: With dead ends: 114 [2019-11-15 21:26:35,738 INFO L226 Difference]: Without dead ends: 94 [2019-11-15 21:26:35,739 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:26:35,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-15 21:26:35,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2019-11-15 21:26:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 21:26:35,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2019-11-15 21:26:35,744 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 30 [2019-11-15 21:26:35,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,745 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2019-11-15 21:26:35,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:35,745 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2019-11-15 21:26:35,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-15 21:26:35,753 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,753 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] [2019-11-15 21:26:35,754 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,755 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2019-11-15 21:26:35,755 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,755 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052280142] [2019-11-15 21:26:35,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,755 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:35,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,826 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,827 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052280142] [2019-11-15 21:26:35,827 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,827 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:35,827 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830791218] [2019-11-15 21:26:35,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:35,828 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:35,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:35,828 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand 5 states. [2019-11-15 21:26:35,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,883 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2019-11-15 21:26:35,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:35,884 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 30 [2019-11-15 21:26:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,885 INFO L225 Difference]: With dead ends: 100 [2019-11-15 21:26:35,885 INFO L226 Difference]: Without dead ends: 74 [2019-11-15 21:26:35,886 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-11-15 21:26:35,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2019-11-15 21:26:35,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2019-11-15 21:26:35,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 21:26:35,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-11-15 21:26:35,890 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 30 [2019-11-15 21:26:35,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,890 INFO L462 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-11-15 21:26:35,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:35,891 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2019-11-15 21:26:35,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:26:35,891 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,891 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] [2019-11-15 21:26:35,892 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,892 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2019-11-15 21:26:35,893 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,893 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885714826] [2019-11-15 21:26:35,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,893 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:35,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:35,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885714826] [2019-11-15 21:26:35,942 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:35,942 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:35,942 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690919756] [2019-11-15 21:26:35,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:35,943 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:35,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:35,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:35,943 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand 3 states. [2019-11-15 21:26:35,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:35,961 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2019-11-15 21:26:35,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:35,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-15 21:26:35,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:35,963 INFO L225 Difference]: With dead ends: 131 [2019-11-15 21:26:35,963 INFO L226 Difference]: Without dead ends: 127 [2019-11-15 21:26:35,963 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-11-15 21:26:35,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2019-11-15 21:26:35,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2019-11-15 21:26:35,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2019-11-15 21:26:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2019-11-15 21:26:35,971 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 31 [2019-11-15 21:26:35,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:35,972 INFO L462 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2019-11-15 21:26:35,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:35,972 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2019-11-15 21:26:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-15 21:26:35,973 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:35,974 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] [2019-11-15 21:26:35,974 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:35,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:35,975 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2019-11-15 21:26:35,975 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:35,975 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166090285] [2019-11-15 21:26:35,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,975 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:35,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,062 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166090285] [2019-11-15 21:26:36,063 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,063 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:36,063 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100095287] [2019-11-15 21:26:36,063 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:36,063 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:36,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:36,064 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand 4 states. [2019-11-15 21:26:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,089 INFO L93 Difference]: Finished difference Result 163 states and 197 transitions. [2019-11-15 21:26:36,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:36,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-15 21:26:36,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,090 INFO L225 Difference]: With dead ends: 163 [2019-11-15 21:26:36,090 INFO L226 Difference]: Without dead ends: 105 [2019-11-15 21:26:36,091 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-11-15 21:26:36,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2019-11-15 21:26:36,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2019-11-15 21:26:36,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2019-11-15 21:26:36,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2019-11-15 21:26:36,099 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 31 [2019-11-15 21:26:36,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,099 INFO L462 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2019-11-15 21:26:36,099 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:36,099 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2019-11-15 21:26:36,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-15 21:26:36,100 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,100 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-11-15 21:26:36,101 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,101 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2019-11-15 21:26:36,102 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,102 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451394120] [2019-11-15 21:26:36,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,102 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,102 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,150 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451394120] [2019-11-15 21:26:36,150 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,150 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:26:36,150 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581384943] [2019-11-15 21:26:36,151 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-15 21:26:36,151 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:26:36,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:26:36,151 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand 4 states. [2019-11-15 21:26:36,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,198 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2019-11-15 21:26:36,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:26:36,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-11-15 21:26:36,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,199 INFO L225 Difference]: With dead ends: 139 [2019-11-15 21:26:36,199 INFO L226 Difference]: Without dead ends: 93 [2019-11-15 21:26:36,200 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-11-15 21:26:36,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2019-11-15 21:26:36,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2019-11-15 21:26:36,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2019-11-15 21:26:36,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2019-11-15 21:26:36,210 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2019-11-15 21:26:36,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,211 INFO L462 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2019-11-15 21:26:36,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-15 21:26:36,211 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2019-11-15 21:26:36,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:26:36,212 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,212 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-11-15 21:26:36,213 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2019-11-15 21:26:36,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653057443] [2019-11-15 21:26:36,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,249 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653057443] [2019-11-15 21:26:36,249 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,249 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:36,249 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226682606] [2019-11-15 21:26:36,249 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:36,250 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:36,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:36,250 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand 3 states. [2019-11-15 21:26:36,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,267 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2019-11-15 21:26:36,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:36,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-15 21:26:36,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,269 INFO L225 Difference]: With dead ends: 142 [2019-11-15 21:26:36,269 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 21:26:36,269 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-11-15 21:26:36,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 21:26:36,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2019-11-15 21:26:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2019-11-15 21:26:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2019-11-15 21:26:36,278 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 34 [2019-11-15 21:26:36,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,278 INFO L462 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2019-11-15 21:26:36,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:36,279 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2019-11-15 21:26:36,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:26:36,279 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,279 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-11-15 21:26:36,284 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2019-11-15 21:26:36,284 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,284 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069642290] [2019-11-15 21:26:36,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,285 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,285 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069642290] [2019-11-15 21:26:36,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:36,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381242149] [2019-11-15 21:26:36,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:36,316 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:36,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:36,317 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand 3 states. [2019-11-15 21:26:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,344 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2019-11-15 21:26:36,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:36,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-11-15 21:26:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,346 INFO L225 Difference]: With dead ends: 111 [2019-11-15 21:26:36,346 INFO L226 Difference]: Without dead ends: 107 [2019-11-15 21:26:36,346 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-11-15 21:26:36,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2019-11-15 21:26:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2019-11-15 21:26:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 21:26:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2019-11-15 21:26:36,355 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 34 [2019-11-15 21:26:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,355 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2019-11-15 21:26:36,355 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2019-11-15 21:26:36,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-11-15 21:26:36,356 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,356 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-11-15 21:26:36,356 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,357 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2019-11-15 21:26:36,357 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,357 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946880438] [2019-11-15 21:26:36,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,357 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,398 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946880438] [2019-11-15 21:26:36,399 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,399 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:36,399 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273541873] [2019-11-15 21:26:36,399 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:36,399 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:36,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:36,400 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand 5 states. [2019-11-15 21:26:36,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,450 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2019-11-15 21:26:36,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:36,450 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2019-11-15 21:26:36,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,451 INFO L225 Difference]: With dead ends: 112 [2019-11-15 21:26:36,451 INFO L226 Difference]: Without dead ends: 108 [2019-11-15 21:26:36,452 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-11-15 21:26:36,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-11-15 21:26:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2019-11-15 21:26:36,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2019-11-15 21:26:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2019-11-15 21:26:36,460 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 34 [2019-11-15 21:26:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,460 INFO L462 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2019-11-15 21:26:36,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2019-11-15 21:26:36,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:26:36,461 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,461 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-11-15 21:26:36,461 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,462 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2019-11-15 21:26:36,462 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,462 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110921992] [2019-11-15 21:26:36,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,488 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110921992] [2019-11-15 21:26:36,489 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,489 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:36,489 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946230546] [2019-11-15 21:26:36,489 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:36,489 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:36,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:36,490 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand 3 states. [2019-11-15 21:26:36,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,506 INFO L93 Difference]: Finished difference Result 117 states and 131 transitions. [2019-11-15 21:26:36,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:36,507 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-11-15 21:26:36,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,508 INFO L225 Difference]: With dead ends: 117 [2019-11-15 21:26:36,508 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 21:26:36,508 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-11-15 21:26:36,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 21:26:36,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 21:26:36,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 21:26:36,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2019-11-15 21:26:36,515 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 35 [2019-11-15 21:26:36,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,515 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2019-11-15 21:26:36,515 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:36,515 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2019-11-15 21:26:36,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-11-15 21:26:36,516 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,516 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-11-15 21:26:36,516 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,517 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2019-11-15 21:26:36,517 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,517 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538400918] [2019-11-15 21:26:36,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,517 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,573 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538400918] [2019-11-15 21:26:36,573 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,573 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:26:36,574 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453080722] [2019-11-15 21:26:36,574 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 21:26:36,574 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:26:36,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:26:36,575 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand 5 states. [2019-11-15 21:26:36,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,622 INFO L93 Difference]: Finished difference Result 88 states and 93 transitions. [2019-11-15 21:26:36,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:26:36,623 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2019-11-15 21:26:36,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,624 INFO L225 Difference]: With dead ends: 88 [2019-11-15 21:26:36,624 INFO L226 Difference]: Without dead ends: 80 [2019-11-15 21:26:36,624 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-11-15 21:26:36,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-11-15 21:26:36,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2019-11-15 21:26:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2019-11-15 21:26:36,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2019-11-15 21:26:36,630 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 35 [2019-11-15 21:26:36,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,631 INFO L462 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2019-11-15 21:26:36,631 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 21:26:36,631 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2019-11-15 21:26:36,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-15 21:26:36,632 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 21:26:36,632 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] [2019-11-15 21:26:36,632 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 21:26:36,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:26:36,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1765065444, now seen corresponding path program 1 times [2019-11-15 21:26:36,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:26:36,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125059340] [2019-11-15 21:26:36,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:26:36,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:26:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:26:36,659 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:26:36,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125059340] [2019-11-15 21:26:36,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:26:36,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:26:36,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530603968] [2019-11-15 21:26:36,660 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 21:26:36,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:26:36,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:26:36,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:26:36,661 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand 3 states. [2019-11-15 21:26:36,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:26:36,675 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2019-11-15 21:26:36,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:26:36,676 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-15 21:26:36,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 21:26:36,676 INFO L225 Difference]: With dead ends: 80 [2019-11-15 21:26:36,676 INFO L226 Difference]: Without dead ends: 0 [2019-11-15 21:26:36,677 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-11-15 21:26:36,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-15 21:26:36,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-15 21:26:36,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-15 21:26:36,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-15 21:26:36,677 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2019-11-15 21:26:36,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 21:26:36,677 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:26:36,678 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 21:26:36,678 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:26:36,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-15 21:26:36,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-15 21:26:37,258 WARN L191 SmtUtils]: Spent 228.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2019-11-15 21:26:38,165 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 41 [2019-11-15 21:26:38,568 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 43 [2019-11-15 21:26:38,609 INFO L443 ceAbstractionStarter]: For program point L894(lines 894 982) no Hoare annotation was computed. [2019-11-15 21:26:38,609 INFO L443 ceAbstractionStarter]: For program point L432(lines 432 434) no Hoare annotation was computed. [2019-11-15 21:26:38,609 INFO L443 ceAbstractionStarter]: For program point L366(lines 366 407) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L439 ceAbstractionStarter]: At program point L367(lines 366 407) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,610 INFO L439 ceAbstractionStarter]: At program point L169(lines 115 286) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L698(lines 698 727) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L439 ceAbstractionStarter]: At program point L699(lines 698 727) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L237(lines 237 243) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L502(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L502-1(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L502-2(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L502-3(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L502-4(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,610 INFO L443 ceAbstractionStarter]: For program point L502-5(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L502-6(lines 502 525) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L106(lines 106 289) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L767(lines 767 790) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L701(lines 701 726) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503(lines 502 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503-1(lines 502 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503-2(lines 502 525) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (= 1 ~compRegistered~0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1))) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503-3(lines 502 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L371(lines 371 406) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503-4(lines 502 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503-5(lines 502 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L503-6(lines 502 525) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L107(lines 106 289) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:26:38,611 INFO L439 ceAbstractionStarter]: At program point L768(lines 767 790) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L636(lines 636 654) no Hoare annotation was computed. [2019-11-15 21:26:38,611 INFO L443 ceAbstractionStarter]: For program point L636-1(lines 636 654) no Hoare annotation was computed. [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L372(lines 371 406) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,612 INFO L443 ceAbstractionStarter]: For program point L901(lines 901 980) no Hoare annotation was computed. [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-1(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-2(lines 566 573) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1)) [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-3(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-4(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L439(lines 430 457) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-5(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-6(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L571-7(lines 566 573) the Hoare annotation is: false [2019-11-15 21:26:38,612 INFO L443 ceAbstractionStarter]: For program point L175(lines 175 187) no Hoare annotation was computed. [2019-11-15 21:26:38,612 INFO L443 ceAbstractionStarter]: For program point L109(lines 109 288) no Hoare annotation was computed. [2019-11-15 21:26:38,612 INFO L443 ceAbstractionStarter]: For program point L704(lines 704 725) no Hoare annotation was computed. [2019-11-15 21:26:38,612 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L374(lines 373 406) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2019-11-15 21:26:38,612 INFO L439 ceAbstractionStarter]: At program point L110(lines 109 288) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,612 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L639(lines 639 653) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L639-1(lines 639 653) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507-1(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507-2(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L441(lines 441 445) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507-3(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507-4(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507-5(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point L507-6(lines 507 524) no Hoare annotation was computed. [2019-11-15 21:26:38,613 INFO L439 ceAbstractionStarter]: At program point L970(lines 865 1004) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,613 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,614 INFO L443 ceAbstractionStarter]: For program point L772(lines 772 789) no Hoare annotation was computed. [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L574(lines 574 615) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508(lines 507 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508-1(lines 507 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508-2(lines 507 524) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1) (= ~setEventCalled~0 1))) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508-3(lines 507 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508-4(lines 507 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508-5(lines 507 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,614 INFO L439 ceAbstractionStarter]: At program point L508-6(lines 507 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,615 INFO L443 ceAbstractionStarter]: For program point L112(lines 112 287) no Hoare annotation was computed. [2019-11-15 21:26:38,615 INFO L439 ceAbstractionStarter]: At program point L773(lines 772 789) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,615 INFO L443 ceAbstractionStarter]: For program point L707(lines 707 724) no Hoare annotation was computed. [2019-11-15 21:26:38,615 INFO L439 ceAbstractionStarter]: At program point L113(lines 112 287) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,615 INFO L443 ceAbstractionStarter]: For program point L642(lines 642 652) no Hoare annotation was computed. [2019-11-15 21:26:38,615 INFO L443 ceAbstractionStarter]: For program point L642-1(lines 642 652) no Hoare annotation was computed. [2019-11-15 21:26:38,615 INFO L439 ceAbstractionStarter]: At program point L510(lines 509 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,615 INFO L439 ceAbstractionStarter]: At program point L510-1(lines 509 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,615 INFO L439 ceAbstractionStarter]: At program point L510-2(lines 509 524) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse1))) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L510-3(lines 509 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L510-4(lines 509 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L510-5(lines 509 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L510-6(lines 509 524) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,616 INFO L443 ceAbstractionStarter]: For program point L180(lines 180 186) no Hoare annotation was computed. [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L180-1(lines 1 1014) the Hoare annotation is: (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L775(lines 774 789) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L643(lines 636 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,616 INFO L439 ceAbstractionStarter]: At program point L643-1(lines 636 654) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point L115(lines 115 286) no Hoare annotation was computed. [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point L908(lines 908 978) no Hoare annotation was computed. [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point L579(lines 579 598) no Hoare annotation was computed. [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point L447(lines 447 455) no Hoare annotation was computed. [2019-11-15 21:26:38,617 INFO L443 ceAbstractionStarter]: For program point L580(lines 580 585) no Hoare annotation was computed. [2019-11-15 21:26:38,619 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,619 INFO L443 ceAbstractionStarter]: For program point L448(lines 448 450) no Hoare annotation was computed. [2019-11-15 21:26:38,619 INFO L443 ceAbstractionStarter]: For program point L118(lines 118 285) no Hoare annotation was computed. [2019-11-15 21:26:38,620 INFO L439 ceAbstractionStarter]: At program point L52(lines 345 347) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:26:38,620 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,620 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,620 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,620 INFO L443 ceAbstractionStarter]: For program point L121(lines 121 284) no Hoare annotation was computed. [2019-11-15 21:26:38,620 INFO L443 ceAbstractionStarter]: For program point L452(lines 452 454) no Hoare annotation was computed. [2019-11-15 21:26:38,620 INFO L443 ceAbstractionStarter]: For program point L915(lines 915 976) no Hoare annotation was computed. [2019-11-15 21:26:38,621 INFO L439 ceAbstractionStarter]: At program point L651(lines 639 653) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,621 INFO L439 ceAbstractionStarter]: At program point L651-1(lines 639 653) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,621 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-15 21:26:38,621 INFO L443 ceAbstractionStarter]: For program point L124(lines 124 283) no Hoare annotation was computed. [2019-11-15 21:26:38,621 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,621 INFO L439 ceAbstractionStarter]: At program point L587(lines 579 598) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (not (= ~MPR3~0 ~s~0)) (= 1 ~compRegistered~0) (<= .cse0 0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (<= 0 .cse1))) [2019-11-15 21:26:38,622 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,622 INFO L439 ceAbstractionStarter]: At program point L522(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,622 INFO L439 ceAbstractionStarter]: At program point L522-1(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,622 INFO L439 ceAbstractionStarter]: At program point L522-2(lines 486 550) the Hoare annotation is: (let ((.cse12 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse13 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse11 (+ ~NP~0 4))) (let ((.cse0 (= ~s~0 ~MPR1~0)) (.cse1 (= ULTIMATE.start_main_~status~1 0)) (.cse2 (<= .cse11 ~MPR1~0)) (.cse3 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse4 (not (= 1 ~pended~0))) (.cse5 (<= 0 .cse13)) (.cse6 (<= .cse13 0)) (.cse7 (= 1 ~compRegistered~0)) (.cse8 (<= .cse12 0)) (.cse10 (<= 0 .cse12)) (.cse9 (= ~setEventCalled~0 1))) (or (and .cse0 (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse5 .cse6 (<= .cse11 ~s~0) .cse8 (and .cse0 .cse3 .cse4 .cse1 .cse7 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) .cse10) (and .cse0 .cse1 (<= (+ ULTIMATE.start_IofCallDriver_~returnVal2~0 1073741823) 0) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse10 .cse9)))) [2019-11-15 21:26:38,622 INFO L439 ceAbstractionStarter]: At program point L522-3(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,623 INFO L439 ceAbstractionStarter]: At program point L522-4(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,623 INFO L439 ceAbstractionStarter]: At program point L522-5(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,623 INFO L439 ceAbstractionStarter]: At program point L522-6(lines 486 550) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,623 INFO L439 ceAbstractionStarter]: At program point L787(lines 751 818) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,623 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,623 INFO L443 ceAbstractionStarter]: For program point L127(lines 127 282) no Hoare annotation was computed. [2019-11-15 21:26:38,624 INFO L439 ceAbstractionStarter]: At program point L722(lines 697 741) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,624 INFO L443 ceAbstractionStarter]: For program point L922(lines 922 974) no Hoare annotation was computed. [2019-11-15 21:26:38,624 INFO L443 ceAbstractionStarter]: For program point L592(lines 592 596) no Hoare annotation was computed. [2019-11-15 21:26:38,624 INFO L439 ceAbstractionStarter]: At program point L592-1(lines 592 596) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,624 INFO L439 ceAbstractionStarter]: At program point L328(lines 322 463) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-11-15 21:26:38,624 INFO L443 ceAbstractionStarter]: For program point L130(lines 130 281) no Hoare annotation was computed. [2019-11-15 21:26:38,625 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,625 INFO L443 ceAbstractionStarter]: For program point L197(lines 197 203) no Hoare annotation was computed. [2019-11-15 21:26:38,625 INFO L443 ceAbstractionStarter]: For program point L197-2(lines 170 266) no Hoare annotation was computed. [2019-11-15 21:26:38,625 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-11-15 21:26:38,625 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,625 INFO L439 ceAbstractionStarter]: At program point L660(lines 627 662) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,625 INFO L439 ceAbstractionStarter]: At program point L660-1(lines 627 662) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,626 INFO L446 ceAbstractionStarter]: At program point L462(lines 293 464) the Hoare annotation is: true [2019-11-15 21:26:38,626 INFO L443 ceAbstractionStarter]: For program point L133(lines 133 280) no Hoare annotation was computed. [2019-11-15 21:26:38,626 INFO L443 ceAbstractionStarter]: For program point L530(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,626 INFO L443 ceAbstractionStarter]: For program point L530-1(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,626 INFO L443 ceAbstractionStarter]: For program point L530-2(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,626 INFO L443 ceAbstractionStarter]: For program point L530-3(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,626 INFO L443 ceAbstractionStarter]: For program point L530-4(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L443 ceAbstractionStarter]: For program point L530-5(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L443 ceAbstractionStarter]: For program point L530-6(lines 530 547) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L443 ceAbstractionStarter]: For program point L795(lines 795 815) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L443 ceAbstractionStarter]: For program point L531(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L443 ceAbstractionStarter]: For program point L531-3(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L443 ceAbstractionStarter]: For program point L531-6(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,627 INFO L439 ceAbstractionStarter]: At program point L267(lines 170 268) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point L531-9(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point L531-12(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point L531-15(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point L531-18(lines 531 537) no Hoare annotation was computed. [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point L136(lines 136 279) no Hoare annotation was computed. [2019-11-15 21:26:38,628 INFO L443 ceAbstractionStarter]: For program point L929(lines 929 972) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L798(lines 798 804) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L601(lines 601 613) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L469(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L469-2(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L337(lines 337 340) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L469-4(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,629 INFO L443 ceAbstractionStarter]: For program point L337-2(lines 337 340) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L469-6(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L205(lines 205 211) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L469-8(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L139(lines 139 278) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L469-10(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L469-12(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L469-14(lines 469 475) no Hoare annotation was computed. [2019-11-15 21:26:38,630 INFO L443 ceAbstractionStarter]: For program point L932(lines 932 971) no Hoare annotation was computed. [2019-11-15 21:26:38,631 INFO L439 ceAbstractionStarter]: At program point L602(lines 601 613) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,631 INFO L443 ceAbstractionStarter]: For program point L206(lines 206 210) no Hoare annotation was computed. [2019-11-15 21:26:38,631 INFO L439 ceAbstractionStarter]: At program point L74(lines 328 411) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:26:38,631 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,631 INFO L439 ceAbstractionStarter]: At program point L933(lines 873 988) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,631 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,632 INFO L439 ceAbstractionStarter]: At program point L604(lines 603 613) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,632 INFO L443 ceAbstractionStarter]: For program point L142(lines 142 277) no Hoare annotation was computed. [2019-11-15 21:26:38,632 INFO L443 ceAbstractionStarter]: For program point L539(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,632 INFO L443 ceAbstractionStarter]: For program point L539-2(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,632 INFO L443 ceAbstractionStarter]: For program point L539-4(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,632 INFO L443 ceAbstractionStarter]: For program point L539-6(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,632 INFO L443 ceAbstractionStarter]: For program point L539-8(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,633 INFO L443 ceAbstractionStarter]: For program point L539-10(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,633 INFO L443 ceAbstractionStarter]: For program point L539-12(lines 539 546) no Hoare annotation was computed. [2019-11-15 21:26:38,633 INFO L443 ceAbstractionStarter]: For program point L672(lines 672 678) no Hoare annotation was computed. [2019-11-15 21:26:38,633 INFO L443 ceAbstractionStarter]: For program point L672-2(lines 672 678) no Hoare annotation was computed. [2019-11-15 21:26:38,633 INFO L443 ceAbstractionStarter]: For program point L672-4(lines 672 678) no Hoare annotation was computed. [2019-11-15 21:26:38,633 INFO L439 ceAbstractionStarter]: At program point L1003(lines 820 1005) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,633 INFO L443 ceAbstractionStarter]: For program point L145(lines 145 276) no Hoare annotation was computed. [2019-11-15 21:26:38,634 INFO L443 ceAbstractionStarter]: For program point L938(lines 938 941) no Hoare annotation was computed. [2019-11-15 21:26:38,634 INFO L439 ceAbstractionStarter]: At program point L740(lines 687 742) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,634 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,634 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,634 INFO L443 ceAbstractionStarter]: For program point L873(lines 873 988) no Hoare annotation was computed. [2019-11-15 21:26:38,634 INFO L443 ceAbstractionStarter]: For program point L807(lines 807 814) no Hoare annotation was computed. [2019-11-15 21:26:38,634 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point L148(lines 148 275) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point L413(lines 413 417) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 274) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point L1011(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point L1011-1(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,635 INFO L443 ceAbstractionStarter]: For program point L1011-2(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-3(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-4(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-5(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-6(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-7(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-8(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-9(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,636 INFO L443 ceAbstractionStarter]: For program point L1011-10(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,637 INFO L443 ceAbstractionStarter]: For program point L1011-11(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,637 INFO L443 ceAbstractionStarter]: For program point L1011-12(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,637 INFO L443 ceAbstractionStarter]: For program point L1011-13(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,637 INFO L439 ceAbstractionStarter]: At program point L549(lines 479 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,637 INFO L443 ceAbstractionStarter]: For program point L1011-14(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,637 INFO L439 ceAbstractionStarter]: At program point L549-1(lines 479 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,637 INFO L443 ceAbstractionStarter]: For program point L1011-15(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,638 INFO L439 ceAbstractionStarter]: At program point L549-2(lines 479 551) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse12 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse4 (<= 0 .cse12)) (.cse5 (<= .cse12 0)) (.cse7 (<= .cse11 0)) (.cse1 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse9 (<= 0 .cse11)) (.cse8 (= ~setEventCalled~0 1)) (.cse2 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse3 (not (= 1 ~pended~0))) (.cse0 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (= ~NP~0 ~s~0)) (.cse6 (= 1 ~compRegistered~0))) (or (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse0 .cse1 .cse2 .cse3 .cse4 (= ~MPR3~0 ~s~0) (<= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse5 .cse6 (<= |ULTIMATE.start_IofCallDriver_#res| 259) .cse7 .cse8 .cse9) (and (and (and .cse2 .cse3 .cse0 .cse10 .cse6) .cse4 .cse5 .cse7 .cse1 .cse9) .cse8) (and .cse2 .cse3 .cse0 .cse10 .cse6 (= 0 |ULTIMATE.start_IofCallDriver_#res|) (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0))))) [2019-11-15 21:26:38,638 INFO L443 ceAbstractionStarter]: For program point L1011-16(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,638 INFO L439 ceAbstractionStarter]: At program point L549-3(lines 479 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,638 INFO L443 ceAbstractionStarter]: For program point L1011-17(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,638 INFO L439 ceAbstractionStarter]: At program point L549-4(lines 479 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,639 INFO L443 ceAbstractionStarter]: For program point L1011-18(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,639 INFO L443 ceAbstractionStarter]: For program point L1011-19(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,639 INFO L439 ceAbstractionStarter]: At program point L549-5(lines 479 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,639 INFO L443 ceAbstractionStarter]: For program point L351(lines 351 410) no Hoare annotation was computed. [2019-11-15 21:26:38,639 INFO L443 ceAbstractionStarter]: For program point L1011-20(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,639 INFO L439 ceAbstractionStarter]: At program point L549-6(lines 479 551) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,639 INFO L443 ceAbstractionStarter]: For program point L1011-21(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-22(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-23(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-24(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-25(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-26(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-27(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,640 INFO L443 ceAbstractionStarter]: For program point L1011-28(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,641 INFO L439 ceAbstractionStarter]: At program point L1012(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,641 INFO L439 ceAbstractionStarter]: At program point L1012-2(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,641 INFO L439 ceAbstractionStarter]: At program point L1012-3(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,641 INFO L439 ceAbstractionStarter]: At program point L1012-5(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,641 INFO L439 ceAbstractionStarter]: At program point L1012-9(lines 1 1014) the Hoare annotation is: (let ((.cse11 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802)) (.cse12 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802))) (let ((.cse4 (= ~NP~0 ~s~0)) (.cse3 (= ULTIMATE.start_main_~status~1 0)) (.cse8 (<= (+ ~NP~0 4) ~MPR1~0)) (.cse0 (= 0 ULTIMATE.start_KbFilter_PnP_~status~0)) (.cse1 (not (= 1 ~pended~0))) (.cse2 (<= 0 .cse12)) (.cse5 (<= .cse12 0)) (.cse6 (= 1 ~compRegistered~0)) (.cse7 (<= .cse11 0)) (.cse10 (= ~setEventCalled~0 1)) (.cse9 (<= 0 .cse11))) (or (and (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) .cse10) (and .cse0 .cse1 .cse3 .cse4 .cse6 (= 0 ULTIMATE.start_IofCallDriver_~returnVal2~0)) (and (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) .cse3 .cse8 .cse0 .cse1 .cse2 (= ~MPR3~0 ~s~0) .cse5 .cse6 .cse7 .cse10 .cse9)))) [2019-11-15 21:26:38,642 INFO L439 ceAbstractionStarter]: At program point L1012-12(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,642 INFO L439 ceAbstractionStarter]: At program point L1012-14(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,642 INFO L439 ceAbstractionStarter]: At program point L1012-15(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,642 INFO L439 ceAbstractionStarter]: At program point L1012-17(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,642 INFO L439 ceAbstractionStarter]: At program point L1012-18(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,642 INFO L439 ceAbstractionStarter]: At program point L352(lines 351 410) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,643 INFO L439 ceAbstractionStarter]: At program point L1012-20(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,643 INFO L439 ceAbstractionStarter]: At program point L1012-21(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,643 INFO L439 ceAbstractionStarter]: At program point L1012-23(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,643 INFO L439 ceAbstractionStarter]: At program point L1012-24(lines 552 565) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,643 INFO L439 ceAbstractionStarter]: At program point L1012-25(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,643 INFO L443 ceAbstractionStarter]: For program point L154(lines 154 273) no Hoare annotation was computed. [2019-11-15 21:26:38,644 INFO L439 ceAbstractionStarter]: At program point L1012-27(lines 1 1014) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,644 INFO L443 ceAbstractionStarter]: For program point L881(lines 881 986) no Hoare annotation was computed. [2019-11-15 21:26:38,644 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,644 INFO L439 ceAbstractionStarter]: At program point L419(lines 412 461) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-11-15 21:26:38,644 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,644 INFO L443 ceAbstractionStarter]: For program point L221(lines 221 227) no Hoare annotation was computed. [2019-11-15 21:26:38,644 INFO L439 ceAbstractionStarter]: At program point L882(lines 881 986) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,645 INFO L439 ceAbstractionStarter]: At program point L684(lines 663 686) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,645 INFO L439 ceAbstractionStarter]: At program point L684-1(lines 663 686) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,645 INFO L439 ceAbstractionStarter]: At program point L684-2(lines 663 686) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,645 INFO L439 ceAbstractionStarter]: At program point L817(lines 743 819) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,645 INFO L443 ceAbstractionStarter]: For program point L487(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,646 INFO L439 ceAbstractionStarter]: At program point L487-1(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,646 INFO L443 ceAbstractionStarter]: For program point L487-2(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,646 INFO L443 ceAbstractionStarter]: For program point L421(lines 421 425) no Hoare annotation was computed. [2019-11-15 21:26:38,646 INFO L439 ceAbstractionStarter]: At program point L487-3(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,646 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,646 INFO L443 ceAbstractionStarter]: For program point L487-4(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,647 INFO L439 ceAbstractionStarter]: At program point L487-5(lines 487 499) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_IofCallDriver_~__cil_tmp7~0 1073741802)) (.cse1 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~s~0 ~MPR1~0) (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (<= 0 .cse0) (= ULTIMATE.start_main_~status~1 0) (<= .cse0 0) (= 1 ~compRegistered~0) (<= .cse1 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse1))) [2019-11-15 21:26:38,647 INFO L443 ceAbstractionStarter]: For program point L487-6(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,647 INFO L439 ceAbstractionStarter]: At program point L487-7(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,647 INFO L443 ceAbstractionStarter]: For program point L487-8(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,647 INFO L439 ceAbstractionStarter]: At program point L487-9(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,647 INFO L443 ceAbstractionStarter]: For program point L157(lines 157 272) no Hoare annotation was computed. [2019-11-15 21:26:38,647 INFO L443 ceAbstractionStarter]: For program point L487-10(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,648 INFO L439 ceAbstractionStarter]: At program point L487-11(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,648 INFO L443 ceAbstractionStarter]: For program point L487-12(lines 487 499) no Hoare annotation was computed. [2019-11-15 21:26:38,648 INFO L439 ceAbstractionStarter]: At program point L487-13(lines 487 499) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,648 INFO L443 ceAbstractionStarter]: For program point L752(lines 752 764) no Hoare annotation was computed. [2019-11-15 21:26:38,648 INFO L439 ceAbstractionStarter]: At program point L752-1(lines 752 764) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~SKIP1~0 ~s~0)) [2019-11-15 21:26:38,648 INFO L443 ceAbstractionStarter]: For program point L356(lines 356 409) no Hoare annotation was computed. [2019-11-15 21:26:38,649 INFO L439 ceAbstractionStarter]: At program point L290(lines 79 292) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0)) [2019-11-15 21:26:38,649 INFO L439 ceAbstractionStarter]: At program point L357(lines 356 409) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,649 INFO L443 ceAbstractionStarter]: For program point L556(lines 556 562) no Hoare annotation was computed. [2019-11-15 21:26:38,649 INFO L443 ceAbstractionStarter]: For program point L556-2(lines 556 562) no Hoare annotation was computed. [2019-11-15 21:26:38,649 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 271) no Hoare annotation was computed. [2019-11-15 21:26:38,649 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-15 21:26:38,649 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,650 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,650 INFO L443 ceAbstractionStarter]: For program point L954(lines 954 956) no Hoare annotation was computed. [2019-11-15 21:26:38,650 INFO L443 ceAbstractionStarter]: For program point L954-2(lines 932 969) no Hoare annotation was computed. [2019-11-15 21:26:38,650 INFO L439 ceAbstractionStarter]: At program point L624(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,650 INFO L439 ceAbstractionStarter]: At program point L624-1(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,650 INFO L439 ceAbstractionStarter]: At program point L624-2(lines 616 626) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= 0 ULTIMATE.start_KbFilter_PnP_~status~0) (not (= 1 ~pended~0)) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (= 1 ~compRegistered~0) (<= .cse0 0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~setEventCalled~0 1) (<= 0 .cse0))) [2019-11-15 21:26:38,650 INFO L439 ceAbstractionStarter]: At program point L624-3(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,651 INFO L439 ceAbstractionStarter]: At program point L624-4(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,651 INFO L439 ceAbstractionStarter]: At program point L624-5(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,651 INFO L439 ceAbstractionStarter]: At program point L624-6(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,651 INFO L439 ceAbstractionStarter]: At program point L624-7(lines 616 626) the Hoare annotation is: false [2019-11-15 21:26:38,651 INFO L443 ceAbstractionStarter]: For program point L889(lines 889 984) no Hoare annotation was computed. [2019-11-15 21:26:38,651 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,651 INFO L443 ceAbstractionStarter]: For program point L493(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L493-2(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L439 ceAbstractionStarter]: At program point L427(lines 420 460) the Hoare annotation is: (not (= 1 ~pended~0)) [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L361(lines 361 408) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L493-4(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L493-6(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L493-8(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L163(lines 163 270) no Hoare annotation was computed. [2019-11-15 21:26:38,652 INFO L443 ceAbstractionStarter]: For program point L493-10(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,653 INFO L443 ceAbstractionStarter]: For program point L493-12(lines 493 497) no Hoare annotation was computed. [2019-11-15 21:26:38,653 INFO L439 ceAbstractionStarter]: At program point L890(lines 889 984) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0)) [2019-11-15 21:26:38,653 INFO L443 ceAbstractionStarter]: For program point L758(lines 758 762) no Hoare annotation was computed. [2019-11-15 21:26:38,653 INFO L446 ceAbstractionStarter]: At program point L428(lines 412 461) the Hoare annotation is: true [2019-11-15 21:26:38,653 INFO L439 ceAbstractionStarter]: At program point L362(lines 361 408) the Hoare annotation is: (and (not (= 1 ~pended~0)) (= 0 ~compRegistered~0) (= ULTIMATE.start_main_~status~1 0) (= ~NP~0 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2019-11-15 21:26:38,653 INFO L443 ceAbstractionStarter]: For program point L957-1(lines 957 959) no Hoare annotation was computed. [2019-11-15 21:26:38,654 INFO L443 ceAbstractionStarter]: For program point L429(lines 429 458) no Hoare annotation was computed. [2019-11-15 21:26:38,654 INFO L443 ceAbstractionStarter]: For program point L430(lines 430 457) no Hoare annotation was computed. [2019-11-15 21:26:38,654 INFO L443 ceAbstractionStarter]: For program point L166(lines 166 269) no Hoare annotation was computed. [2019-11-15 21:26:38,654 INFO L443 ceAbstractionStarter]: For program point L431(lines 431 437) no Hoare annotation was computed. [2019-11-15 21:26:38,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1011) no Hoare annotation was computed. [2019-11-15 21:26:38,695 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 09:26:38 BoogieIcfgContainer [2019-11-15 21:26:38,696 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 21:26:38,696 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:26:38,696 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:26:38,696 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:26:38,697 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:26:33" (3/4) ... [2019-11-15 21:26:38,700 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-15 21:26:38,727 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 56 nodes and edges [2019-11-15 21:26:38,729 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 37 nodes and edges [2019-11-15 21:26:38,732 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2019-11-15 21:26:38,768 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-11-15 21:26:38,769 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 [2019-11-15 21:26:38,769 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s == MPR1 && returnVal2 <= 259) && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || (((((0 <= __cil_tmp7 + 1073741802 && __cil_tmp7 + 1073741802 <= 0) && NP + 4 <= s) && \result + 1073741802 <= 0) && ((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 == compRegistered) && 0 == returnVal2) && 0 <= \result + 1073741802)) || (((((((((((s == MPR1 && status == 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && 0 <= \result + 1073741802) && setEventCalled == 1) [2019-11-15 21:26:38,770 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((0 == status && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == returnVal2)) || ((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) [2019-11-15 21:26:38,770 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && 259 <= \result) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result <= 259) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || ((((((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == \result) && 0 == returnVal2) [2019-11-15 21:26:38,770 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1 [2019-11-15 21:26:38,770 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-11-15 21:26:38,771 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 [2019-11-15 21:26:38,772 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(1 == pended) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && !(MPR3 == s)) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 [2019-11-15 21:26:38,910 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c44582ad-6e5a-4fe5-b2ac-609e97a7b203/bin/uautomizer/witness.graphml [2019-11-15 21:26:38,911 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:26:38,912 INFO L168 Benchmark]: Toolchain (without parser) took 7155.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 952.8 MB in the beginning and 883.6 MB in the end (delta: 69.1 MB). Peak memory consumption was 274.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:38,912 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:26:38,913 INFO L168 Benchmark]: CACSL2BoogieTranslator took 527.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:38,913 INFO L168 Benchmark]: Boogie Procedure Inliner took 84.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:38,913 INFO L168 Benchmark]: Boogie Preprocessor took 88.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:26:38,914 INFO L168 Benchmark]: RCFGBuilder took 1406.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:38,914 INFO L168 Benchmark]: TraceAbstraction took 4829.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.0 GB in the beginning and 924.6 MB in the end (delta: 89.6 MB). Peak memory consumption was 151.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:38,914 INFO L168 Benchmark]: Witness Printer took 214.94 ms. Allocated memory is still 1.2 GB. Free memory was 924.6 MB in the beginning and 883.6 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. [2019-11-15 21:26:38,916 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.24 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 527.30 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.5 MB). Free memory was 952.8 MB in the beginning and 1.1 GB in the end (delta: -188.2 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 84.36 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 88.26 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 1406.60 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 114.7 MB). Peak memory consumption was 114.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4829.19 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 54.0 MB). Free memory was 1.0 GB in the beginning and 924.6 MB in the end (delta: 89.6 MB). Peak memory consumption was 151.7 MB. Max. memory is 11.5 GB. * Witness Printer took 214.94 ms. Allocated memory is still 1.2 GB. Free memory was 924.6 MB in the beginning and 883.6 MB in the end (delta: 40.9 MB). Peak memory consumption was 40.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1011]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 636]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 507]: Loop Invariant Derived loop invariant: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1) && setEventCalled == 1 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (((((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && 259 <= \result) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result <= 259) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || ((((((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1)) || ((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == \result) && 0 == returnVal2) - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 430]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && NP + 4 <= MPR1 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 361]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 639]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 115]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 663]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 881]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 479]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 566]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 820]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 865]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 697]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 79]: Loop Invariant Derived loop invariant: !(1 == pended) && status == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 889]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 366]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 412]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 579]: Loop Invariant Derived loop invariant: ((((((((!(1 == pended) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && !(MPR3 == s)) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 - InvariantResult [Line: 371]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 322]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 752]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 112]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 420]: Loop Invariant Derived loop invariant: !(1 == pended) - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 592]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: (((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 767]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 345]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 751]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 170]: Loop Invariant Derived loop invariant: !(1 == pended) && status == 0 - InvariantResult [Line: 552]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 487]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 698]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 109]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 873]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 687]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 293]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 328]: Loop Invariant Derived loop invariant: (((!(1 == pended) && 0 == compRegistered) && status == 0) && !(MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 627]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: ((((0 == status && !(1 == pended)) && 0 == compRegistered) && status == 0) && NP == s) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 743]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 772]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: (((((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && setEventCalled == 1) && 0 <= \result + 1073741802 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((((0 == status && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && NP == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802) && setEventCalled == 1) || (((((0 == status && !(1 == pended)) && status == 0) && NP == s) && 1 == compRegistered) && 0 == returnVal2)) || ((((((((((((returnVal2 <= 259 && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && MPR3 == s) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 502]: Loop Invariant Derived loop invariant: ((((((((s == MPR1 && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && status == 0) && 1 == compRegistered) && __cil_tmp7 + 1073741802 <= 0) && \result + 1073741802 <= 0) && NP + 4 <= MPR1) && 0 <= \result + 1073741802 - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: (((((((((((((s == MPR1 && returnVal2 <= 259) && 259 <= returnVal2) && status == 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && setEventCalled == 1) && 0 <= \result + 1073741802) || (((((0 <= __cil_tmp7 + 1073741802 && __cil_tmp7 + 1073741802 <= 0) && NP + 4 <= s) && \result + 1073741802 <= 0) && ((((s == MPR1 && 0 == status) && !(1 == pended)) && status == 0) && 1 == compRegistered) && 0 == returnVal2) && 0 <= \result + 1073741802)) || (((((((((((s == MPR1 && status == 0) && returnVal2 + 1073741823 <= 0) && NP + 4 <= MPR1) && 0 == status) && !(1 == pended)) && 0 <= __cil_tmp7 + 1073741802) && __cil_tmp7 + 1073741802 <= 0) && 1 == compRegistered) && \result + 1073741802 <= 0) && 0 <= \result + 1073741802) && setEventCalled == 1) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 356]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && NP == s - InvariantResult [Line: 486]: Loop Invariant Derived loop invariant: ((!(1 == pended) && 0 == compRegistered) && status == 0) && SKIP1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (!(1 == pended) && 0 == compRegistered) && status == 0 - InvariantResult [Line: 601]: Loop Invariant Derived loop invariant: (!(1 == pended) && status == 0) && NP == s - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 328 locations, 29 error locations. Result: SAFE, OverallTime: 4.7s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 1.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 1.9s, HoareTripleCheckerStatistics: 2592 SDtfs, 1840 SDslu, 1221 SDs, 0 SdLazy, 403 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 125 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 123 LocationsWithAnnotation, 123 PreInvPairs, 260 NumberOfFragments, 1940 HoareAnnotationTreeSize, 123 FomulaSimplifications, 1748 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 123 FomulaSimplificationsInter, 605 FormulaSimplificationTreeSizeReductionInter, 1.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 508 NumberOfCodeBlocks, 508 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 490 ConstructedInterpolants, 0 QuantifiedInterpolants, 26445 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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 correct! Received shutdown request...