./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 20ed64ec Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3e0d5536f9cd1f3a5d711f95a0369e25308fe790 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-20ed64e [2021-08-25 20:11:50,744 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-25 20:11:50,747 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-25 20:11:50,790 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-25 20:11:50,791 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-25 20:11:50,794 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-25 20:11:50,796 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-25 20:11:50,801 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-25 20:11:50,803 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-25 20:11:50,807 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-25 20:11:50,809 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-25 20:11:50,812 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-25 20:11:50,813 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-25 20:11:50,815 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-25 20:11:50,816 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-25 20:11:50,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-25 20:11:50,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-25 20:11:50,821 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-25 20:11:50,823 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-25 20:11:50,829 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-25 20:11:50,830 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-25 20:11:50,831 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-25 20:11:50,832 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-25 20:11:50,834 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-25 20:11:50,840 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-25 20:11:50,840 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-25 20:11:50,841 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-25 20:11:50,842 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-25 20:11:50,843 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-25 20:11:50,844 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-25 20:11:50,844 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-25 20:11:50,845 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-25 20:11:50,846 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-25 20:11:50,847 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-25 20:11:50,848 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-25 20:11:50,848 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-25 20:11:50,849 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-25 20:11:50,849 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-25 20:11:50,849 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-25 20:11:50,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-25 20:11:50,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-25 20:11:50,852 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-25 20:11:50,890 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-25 20:11:50,890 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-25 20:11:50,891 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-25 20:11:50,891 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-25 20:11:50,893 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-25 20:11:50,893 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-25 20:11:50,893 INFO L138 SettingsManager]: * Use SBE=true [2021-08-25 20:11:50,894 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-25 20:11:50,894 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-25 20:11:50,894 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-25 20:11:50,895 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-25 20:11:50,895 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-25 20:11:50,895 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-25 20:11:50,895 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-25 20:11:50,896 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-25 20:11:50,896 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-25 20:11:50,896 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-25 20:11:50,896 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-25 20:11:50,896 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-25 20:11:50,896 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-25 20:11:50,897 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-25 20:11:50,897 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-25 20:11:50,897 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:50,897 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-25 20:11:50,897 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-25 20:11:50,898 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-25 20:11:50,898 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-25 20:11:50,898 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-25 20:11:50,898 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-25 20:11:50,898 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-25 20:11:50,898 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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(reach_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 -> 3e0d5536f9cd1f3a5d711f95a0369e25308fe790 [2021-08-25 20:11:51,235 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-25 20:11:51,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-25 20:11:51,264 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-25 20:11:51,265 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-25 20:11:51,266 INFO L275 PluginConnector]: CDTParser initialized [2021-08-25 20:11:51,267 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-08-25 20:11:51,340 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1a95c6a/0ce2fc9e380e4a1aa95490fe830a9d02/FLAG788e20af6 [2021-08-25 20:11:51,764 INFO L306 CDTParser]: Found 1 translation units. [2021-08-25 20:11:51,766 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-08-25 20:11:51,782 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1a95c6a/0ce2fc9e380e4a1aa95490fe830a9d02/FLAG788e20af6 [2021-08-25 20:11:51,798 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff1a95c6a/0ce2fc9e380e4a1aa95490fe830a9d02 [2021-08-25 20:11:51,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-25 20:11:51,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-25 20:11:51,805 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:51,805 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-25 20:11:51,808 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-25 20:11:51,809 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:51" (1/1) ... [2021-08-25 20:11:51,810 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9924d67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:51, skipping insertion in model container [2021-08-25 20:11:51,810 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.08 08:11:51" (1/1) ... [2021-08-25 20:11:51,816 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-25 20:11:51,862 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-25 20:11:52,136 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-08-25 20:11:52,141 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:52,149 INFO L203 MainTranslator]: Completed pre-run [2021-08-25 20:11:52,235 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-08-25 20:11:52,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-25 20:11:52,264 INFO L208 MainTranslator]: Completed translation [2021-08-25 20:11:52,265 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52 WrapperNode [2021-08-25 20:11:52,266 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-25 20:11:52,267 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:52,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-25 20:11:52,268 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-25 20:11:52,274 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,296 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-25 20:11:52,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-25 20:11:52,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-25 20:11:52,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-25 20:11:52,381 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,381 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,398 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,408 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,434 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,452 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-25 20:11:52,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-25 20:11:52,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-25 20:11:52,461 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-25 20:11:52,464 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (1/1) ... [2021-08-25 20:11:52,482 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-25 20:11:52,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-25 20:11:52,498 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-25 20:11:52,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-25 20:11:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-25 20:11:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-25 20:11:52,542 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-25 20:11:52,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-25 20:11:52,717 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,738 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,745 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,751 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,763 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,785 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,795 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,798 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,802 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,804 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,817 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:52,821 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-08-25 20:11:53,512 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-08-25 20:11:53,513 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-08-25 20:11:53,514 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-08-25 20:11:53,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-08-25 20:11:53,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-08-25 20:11:53,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-08-25 20:11:53,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-08-25 20:11:53,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-08-25 20:11:53,515 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-08-25 20:11:53,531 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-25 20:11:53,531 INFO L299 CfgBuilder]: Removed 152 assume(true) statements. [2021-08-25 20:11:53,534 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:53 BoogieIcfgContainer [2021-08-25 20:11:53,534 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-25 20:11:53,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-25 20:11:53,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-25 20:11:53,538 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-25 20:11:53,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.08 08:11:51" (1/3) ... [2021-08-25 20:11:53,539 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c94d8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:53, skipping insertion in model container [2021-08-25 20:11:53,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.08 08:11:52" (2/3) ... [2021-08-25 20:11:53,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c94d8f9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.08 08:11:53, skipping insertion in model container [2021-08-25 20:11:53,540 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:53" (3/3) ... [2021-08-25 20:11:53,542 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2021-08-25 20:11:53,546 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-25 20:11:53,547 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-08-25 20:11:53,586 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-25 20:11:53,592 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-25 20:11:53,592 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-08-25 20:11:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand has 328 states, 298 states have (on average 1.6442953020134228) internal successors, (490), 327 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:53,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-25 20:11:53,616 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:53,616 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:53,617 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:53,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:53,621 INFO L82 PathProgramCache]: Analyzing trace with hash -1766777508, now seen corresponding path program 1 times [2021-08-25 20:11:53,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:53,629 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833825648] [2021-08-25 20:11:53,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:53,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:53,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:53,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:53,818 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:53,819 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833825648] [2021-08-25 20:11:53,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833825648] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:53,820 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:53,820 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:53,821 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642026598] [2021-08-25 20:11:53,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:53,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:53,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:53,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:53,843 INFO L87 Difference]: Start difference. First operand has 328 states, 298 states have (on average 1.6442953020134228) internal successors, (490), 327 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:53,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:53,944 INFO L93 Difference]: Finished difference Result 574 states and 838 transitions. [2021-08-25 20:11:53,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:53,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-25 20:11:53,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:53,957 INFO L225 Difference]: With dead ends: 574 [2021-08-25 20:11:53,957 INFO L226 Difference]: Without dead ends: 320 [2021-08-25 20:11:53,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:53,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2021-08-25 20:11:54,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 320. [2021-08-25 20:11:54,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 291 states have (on average 1.5051546391752577) internal successors, (438), 319 states have internal predecessors, (438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 438 transitions. [2021-08-25 20:11:54,012 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 438 transitions. Word has length 11 [2021-08-25 20:11:54,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:54,013 INFO L470 AbstractCegarLoop]: Abstraction has 320 states and 438 transitions. [2021-08-25 20:11:54,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 438 transitions. [2021-08-25 20:11:54,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-25 20:11:54,014 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:54,014 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:54,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-25 20:11:54,014 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:54,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:54,015 INFO L82 PathProgramCache]: Analyzing trace with hash 557701687, now seen corresponding path program 1 times [2021-08-25 20:11:54,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:54,015 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508932474] [2021-08-25 20:11:54,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:54,016 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:54,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:54,083 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:54,083 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508932474] [2021-08-25 20:11:54,083 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508932474] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:54,084 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:54,084 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:54,084 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909342771] [2021-08-25 20:11:54,085 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:54,085 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:54,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:54,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:54,086 INFO L87 Difference]: Start difference. First operand 320 states and 438 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:54,248 INFO L93 Difference]: Finished difference Result 421 states and 565 transitions. [2021-08-25 20:11:54,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:54,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-25 20:11:54,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:54,254 INFO L225 Difference]: With dead ends: 421 [2021-08-25 20:11:54,254 INFO L226 Difference]: Without dead ends: 360 [2021-08-25 20:11:54,261 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:54,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2021-08-25 20:11:54,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 347. [2021-08-25 20:11:54,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 328 states have (on average 1.4481707317073171) internal successors, (475), 346 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 475 transitions. [2021-08-25 20:11:54,296 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 475 transitions. Word has length 13 [2021-08-25 20:11:54,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:54,296 INFO L470 AbstractCegarLoop]: Abstraction has 347 states and 475 transitions. [2021-08-25 20:11:54,296 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,296 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 475 transitions. [2021-08-25 20:11:54,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-25 20:11:54,297 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:54,297 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:54,297 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-25 20:11:54,298 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:54,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:54,298 INFO L82 PathProgramCache]: Analyzing trace with hash 1900748477, now seen corresponding path program 1 times [2021-08-25 20:11:54,298 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:54,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781671000] [2021-08-25 20:11:54,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:54,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:54,357 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:54,357 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:54,358 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781671000] [2021-08-25 20:11:54,358 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781671000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:54,358 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:54,358 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:54,358 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586452343] [2021-08-25 20:11:54,359 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:54,359 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:54,360 INFO L87 Difference]: Start difference. First operand 347 states and 475 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:54,396 INFO L93 Difference]: Finished difference Result 542 states and 723 transitions. [2021-08-25 20:11:54,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:54,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-25 20:11:54,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:54,398 INFO L225 Difference]: With dead ends: 542 [2021-08-25 20:11:54,398 INFO L226 Difference]: Without dead ends: 354 [2021-08-25 20:11:54,399 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:54,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2021-08-25 20:11:54,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 303. [2021-08-25 20:11:54,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 292 states have (on average 1.428082191780822) internal successors, (417), 302 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 417 transitions. [2021-08-25 20:11:54,430 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 417 transitions. Word has length 15 [2021-08-25 20:11:54,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:54,431 INFO L470 AbstractCegarLoop]: Abstraction has 303 states and 417 transitions. [2021-08-25 20:11:54,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,431 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 417 transitions. [2021-08-25 20:11:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-25 20:11:54,438 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:54,438 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-25 20:11:54,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-25 20:11:54,439 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:54,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:54,440 INFO L82 PathProgramCache]: Analyzing trace with hash 306593718, now seen corresponding path program 1 times [2021-08-25 20:11:54,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:54,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084774055] [2021-08-25 20:11:54,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:54,440 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:54,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:54,533 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:54,533 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084774055] [2021-08-25 20:11:54,533 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084774055] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:54,533 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:54,533 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:54,533 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845618436] [2021-08-25 20:11:54,534 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:54,534 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:54,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:54,535 INFO L87 Difference]: Start difference. First operand 303 states and 417 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:54,678 INFO L93 Difference]: Finished difference Result 303 states and 417 transitions. [2021-08-25 20:11:54,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:54,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-08-25 20:11:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:54,681 INFO L225 Difference]: With dead ends: 303 [2021-08-25 20:11:54,681 INFO L226 Difference]: Without dead ends: 289 [2021-08-25 20:11:54,682 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:54,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2021-08-25 20:11:54,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2021-08-25 20:11:54,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 285 states have (on average 1.4140350877192982) internal successors, (403), 288 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 403 transitions. [2021-08-25 20:11:54,695 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 403 transitions. Word has length 21 [2021-08-25 20:11:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:54,695 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 403 transitions. [2021-08-25 20:11:54,695 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 403 transitions. [2021-08-25 20:11:54,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-08-25 20:11:54,697 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:54,697 INFO L512 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] [2021-08-25 20:11:54,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-25 20:11:54,698 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:54,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:54,700 INFO L82 PathProgramCache]: Analyzing trace with hash 847063989, now seen corresponding path program 1 times [2021-08-25 20:11:54,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:54,701 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678443467] [2021-08-25 20:11:54,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:54,701 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:54,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:54,787 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:54,787 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678443467] [2021-08-25 20:11:54,787 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678443467] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:54,787 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:54,787 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:54,788 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884318942] [2021-08-25 20:11:54,789 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:54,789 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:54,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:54,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:54,790 INFO L87 Difference]: Start difference. First operand 289 states and 403 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:54,929 INFO L93 Difference]: Finished difference Result 309 states and 425 transitions. [2021-08-25 20:11:54,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:54,932 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2021-08-25 20:11:54,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:54,934 INFO L225 Difference]: With dead ends: 309 [2021-08-25 20:11:54,934 INFO L226 Difference]: Without dead ends: 305 [2021-08-25 20:11:54,935 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:54,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-08-25 20:11:54,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 299. [2021-08-25 20:11:54,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 295 states have (on average 1.4067796610169492) internal successors, (415), 298 states have internal predecessors, (415), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 415 transitions. [2021-08-25 20:11:54,955 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 415 transitions. Word has length 26 [2021-08-25 20:11:54,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:54,956 INFO L470 AbstractCegarLoop]: Abstraction has 299 states and 415 transitions. [2021-08-25 20:11:54,956 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:54,956 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 415 transitions. [2021-08-25 20:11:54,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 20:11:54,957 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:54,957 INFO L512 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] [2021-08-25 20:11:54,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-25 20:11:54,958 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:54,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:54,958 INFO L82 PathProgramCache]: Analyzing trace with hash -1660315800, now seen corresponding path program 1 times [2021-08-25 20:11:54,958 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:54,959 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323648713] [2021-08-25 20:11:54,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:54,959 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,026 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,027 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323648713] [2021-08-25 20:11:55,027 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323648713] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,027 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,027 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:55,027 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221511724] [2021-08-25 20:11:55,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:55,028 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:55,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,029 INFO L87 Difference]: Start difference. First operand 299 states and 415 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,118 INFO L93 Difference]: Finished difference Result 343 states and 471 transitions. [2021-08-25 20:11:55,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:55,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-25 20:11:55,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,120 INFO L225 Difference]: With dead ends: 343 [2021-08-25 20:11:55,120 INFO L226 Difference]: Without dead ends: 296 [2021-08-25 20:11:55,121 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2021-08-25 20:11:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 296. [2021-08-25 20:11:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 293 states have (on average 1.4027303754266212) internal successors, (411), 295 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 411 transitions. [2021-08-25 20:11:55,135 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 411 transitions. Word has length 27 [2021-08-25 20:11:55,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,135 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 411 transitions. [2021-08-25 20:11:55,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,135 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 411 transitions. [2021-08-25 20:11:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 20:11:55,136 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,136 INFO L512 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] [2021-08-25 20:11:55,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-25 20:11:55,137 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,137 INFO L82 PathProgramCache]: Analyzing trace with hash -23036524, now seen corresponding path program 1 times [2021-08-25 20:11:55,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,137 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900674533] [2021-08-25 20:11:55,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,172 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,172 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,172 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900674533] [2021-08-25 20:11:55,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900674533] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:55,173 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947412259] [2021-08-25 20:11:55,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:55,173 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:55,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,174 INFO L87 Difference]: Start difference. First operand 296 states and 411 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,201 INFO L93 Difference]: Finished difference Result 360 states and 491 transitions. [2021-08-25 20:11:55,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:55,202 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-25 20:11:55,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,203 INFO L225 Difference]: With dead ends: 360 [2021-08-25 20:11:55,203 INFO L226 Difference]: Without dead ends: 309 [2021-08-25 20:11:55,204 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2021-08-25 20:11:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 296. [2021-08-25 20:11:55,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 293 states have (on average 1.3993174061433447) internal successors, (410), 295 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 410 transitions. [2021-08-25 20:11:55,218 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 410 transitions. Word has length 27 [2021-08-25 20:11:55,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,218 INFO L470 AbstractCegarLoop]: Abstraction has 296 states and 410 transitions. [2021-08-25 20:11:55,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,218 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 410 transitions. [2021-08-25 20:11:55,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-08-25 20:11:55,219 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,219 INFO L512 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] [2021-08-25 20:11:55,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-25 20:11:55,220 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash 476963846, now seen corresponding path program 1 times [2021-08-25 20:11:55,220 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,220 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264352801] [2021-08-25 20:11:55,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,221 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,273 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,273 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,273 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264352801] [2021-08-25 20:11:55,274 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264352801] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,274 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,274 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:55,274 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582835853] [2021-08-25 20:11:55,275 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:55,275 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:55,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:55,276 INFO L87 Difference]: Start difference. First operand 296 states and 410 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,397 INFO L93 Difference]: Finished difference Result 306 states and 419 transitions. [2021-08-25 20:11:55,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:55,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2021-08-25 20:11:55,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,399 INFO L225 Difference]: With dead ends: 306 [2021-08-25 20:11:55,400 INFO L226 Difference]: Without dead ends: 302 [2021-08-25 20:11:55,400 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.1ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:55,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2021-08-25 20:11:55,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 297. [2021-08-25 20:11:55,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 294 states have (on average 1.3979591836734695) internal successors, (411), 296 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 411 transitions. [2021-08-25 20:11:55,432 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 411 transitions. Word has length 27 [2021-08-25 20:11:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,433 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 411 transitions. [2021-08-25 20:11:55,433 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 411 transitions. [2021-08-25 20:11:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-25 20:11:55,434 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,434 INFO L512 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] [2021-08-25 20:11:55,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-25 20:11:55,435 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1894183263, now seen corresponding path program 1 times [2021-08-25 20:11:55,435 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133299896] [2021-08-25 20:11:55,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,436 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,462 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,462 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133299896] [2021-08-25 20:11:55,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133299896] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,463 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:55,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828235653] [2021-08-25 20:11:55,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:55,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:55,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,465 INFO L87 Difference]: Start difference. First operand 297 states and 411 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,487 INFO L93 Difference]: Finished difference Result 309 states and 427 transitions. [2021-08-25 20:11:55,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:55,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-08-25 20:11:55,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,488 INFO L225 Difference]: With dead ends: 309 [2021-08-25 20:11:55,488 INFO L226 Difference]: Without dead ends: 63 [2021-08-25 20:11:55,489 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2021-08-25 20:11:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2021-08-25 20:11:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 62 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2021-08-25 20:11:55,493 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 28 [2021-08-25 20:11:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,493 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2021-08-25 20:11:55,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2021-08-25 20:11:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-25 20:11:55,494 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,494 INFO L512 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] [2021-08-25 20:11:55,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-25 20:11:55,495 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,495 INFO L82 PathProgramCache]: Analyzing trace with hash 403678015, now seen corresponding path program 1 times [2021-08-25 20:11:55,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095801936] [2021-08-25 20:11:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,496 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,561 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,561 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095801936] [2021-08-25 20:11:55,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095801936] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:55,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369321591] [2021-08-25 20:11:55,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:55,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:55,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:55,563 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,606 INFO L93 Difference]: Finished difference Result 114 states and 138 transitions. [2021-08-25 20:11:55,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:55,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-25 20:11:55,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,607 INFO L225 Difference]: With dead ends: 114 [2021-08-25 20:11:55,607 INFO L226 Difference]: Without dead ends: 94 [2021-08-25 20:11:55,608 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 34.7ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:55,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2021-08-25 20:11:55,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 80. [2021-08-25 20:11:55,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.2564102564102564) internal successors, (98), 79 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 98 transitions. [2021-08-25 20:11:55,613 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 98 transitions. Word has length 30 [2021-08-25 20:11:55,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,613 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 98 transitions. [2021-08-25 20:11:55,614 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,614 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 98 transitions. [2021-08-25 20:11:55,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-08-25 20:11:55,614 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,614 INFO L512 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] [2021-08-25 20:11:55,615 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-25 20:11:55,615 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,615 INFO L82 PathProgramCache]: Analyzing trace with hash 361661719, now seen corresponding path program 1 times [2021-08-25 20:11:55,616 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,616 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [307850454] [2021-08-25 20:11:55,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,616 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,656 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,656 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [307850454] [2021-08-25 20:11:55,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [307850454] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,656 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:55,657 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183727285] [2021-08-25 20:11:55,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:55,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:55,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:55,658 INFO L87 Difference]: Start difference. First operand 80 states and 98 transitions. Second operand has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,710 INFO L93 Difference]: Finished difference Result 100 states and 118 transitions. [2021-08-25 20:11:55,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:55,710 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2021-08-25 20:11:55,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,712 INFO L225 Difference]: With dead ends: 100 [2021-08-25 20:11:55,712 INFO L226 Difference]: Without dead ends: 74 [2021-08-25 20:11:55,713 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.1ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2021-08-25 20:11:55,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 67. [2021-08-25 20:11:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 65 states have (on average 1.2307692307692308) internal successors, (80), 66 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2021-08-25 20:11:55,717 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 80 transitions. Word has length 30 [2021-08-25 20:11:55,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,718 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 80 transitions. [2021-08-25 20:11:55,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.0) internal successors, (30), 5 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,718 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 80 transitions. [2021-08-25 20:11:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:55,719 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,719 INFO L512 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] [2021-08-25 20:11:55,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-25 20:11:55,720 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,720 INFO L82 PathProgramCache]: Analyzing trace with hash -378484437, now seen corresponding path program 1 times [2021-08-25 20:11:55,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833719800] [2021-08-25 20:11:55,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,721 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,780 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,780 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,780 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833719800] [2021-08-25 20:11:55,781 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833719800] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,782 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:55,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1572018847] [2021-08-25 20:11:55,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:55,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:55,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,785 INFO L87 Difference]: Start difference. First operand 67 states and 80 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,801 INFO L93 Difference]: Finished difference Result 131 states and 156 transitions. [2021-08-25 20:11:55,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:55,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 20:11:55,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,804 INFO L225 Difference]: With dead ends: 131 [2021-08-25 20:11:55,804 INFO L226 Difference]: Without dead ends: 127 [2021-08-25 20:11:55,804 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:55,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2021-08-25 20:11:55,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 117. [2021-08-25 20:11:55,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 115 states have (on average 1.2347826086956522) internal successors, (142), 116 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 142 transitions. [2021-08-25 20:11:55,811 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 142 transitions. Word has length 31 [2021-08-25 20:11:55,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,812 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 142 transitions. [2021-08-25 20:11:55,812 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,812 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 142 transitions. [2021-08-25 20:11:55,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2021-08-25 20:11:55,813 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,813 INFO L512 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] [2021-08-25 20:11:55,813 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-25 20:11:55,813 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,814 INFO L82 PathProgramCache]: Analyzing trace with hash -378424855, now seen corresponding path program 1 times [2021-08-25 20:11:55,814 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,814 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962121412] [2021-08-25 20:11:55,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,814 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,887 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,887 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962121412] [2021-08-25 20:11:55,887 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962121412] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,887 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,887 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:55,887 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277098124] [2021-08-25 20:11:55,887 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:55,887 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:55,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:55,888 INFO L87 Difference]: Start difference. First operand 117 states and 142 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,910 INFO L93 Difference]: Finished difference Result 163 states and 197 transitions. [2021-08-25 20:11:55,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:55,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2021-08-25 20:11:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:55,912 INFO L225 Difference]: With dead ends: 163 [2021-08-25 20:11:55,912 INFO L226 Difference]: Without dead ends: 105 [2021-08-25 20:11:55,912 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 39.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:55,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2021-08-25 20:11:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2021-08-25 20:11:55,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.203883495145631) internal successors, (124), 104 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 124 transitions. [2021-08-25 20:11:55,919 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 124 transitions. Word has length 31 [2021-08-25 20:11:55,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:55,920 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 124 transitions. [2021-08-25 20:11:55,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,920 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2021-08-25 20:11:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-08-25 20:11:55,920 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:55,920 INFO L512 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] [2021-08-25 20:11:55,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-25 20:11:55,921 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:55,921 INFO L82 PathProgramCache]: Analyzing trace with hash -329006014, now seen corresponding path program 1 times [2021-08-25 20:11:55,921 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:55,921 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [906842169] [2021-08-25 20:11:55,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:55,922 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:55,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:55,965 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:55,965 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [906842169] [2021-08-25 20:11:55,965 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [906842169] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:55,965 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:55,966 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:55,966 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518233252] [2021-08-25 20:11:55,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:55,966 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:55,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:55,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:55,967 INFO L87 Difference]: Start difference. First operand 105 states and 124 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:55,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:55,999 INFO L93 Difference]: Finished difference Result 139 states and 167 transitions. [2021-08-25 20:11:55,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:56,000 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2021-08-25 20:11:56,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,000 INFO L225 Difference]: With dead ends: 139 [2021-08-25 20:11:56,001 INFO L226 Difference]: Without dead ends: 93 [2021-08-25 20:11:56,002 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.7ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:56,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-25 20:11:56,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-25 20:11:56,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 91 states have (on average 1.1868131868131868) internal successors, (108), 92 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 108 transitions. [2021-08-25 20:11:56,029 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 108 transitions. Word has length 32 [2021-08-25 20:11:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,029 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 108 transitions. [2021-08-25 20:11:56,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 108 transitions. [2021-08-25 20:11:56,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:11:56,030 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,030 INFO L512 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] [2021-08-25 20:11:56,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-25 20:11:56,031 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1781478438, now seen corresponding path program 1 times [2021-08-25 20:11:56,031 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,032 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110237917] [2021-08-25 20:11:56,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,032 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,078 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,078 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110237917] [2021-08-25 20:11:56,078 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110237917] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,079 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,079 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:56,079 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939468813] [2021-08-25 20:11:56,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:56,079 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:56,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,080 INFO L87 Difference]: Start difference. First operand 93 states and 108 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,097 INFO L93 Difference]: Finished difference Result 142 states and 168 transitions. [2021-08-25 20:11:56,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:56,098 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-25 20:11:56,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,099 INFO L225 Difference]: With dead ends: 142 [2021-08-25 20:11:56,099 INFO L226 Difference]: Without dead ends: 108 [2021-08-25 20:11:56,101 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-25 20:11:56,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 95. [2021-08-25 20:11:56,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 94 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 110 transitions. [2021-08-25 20:11:56,109 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 110 transitions. Word has length 34 [2021-08-25 20:11:56,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,110 INFO L470 AbstractCegarLoop]: Abstraction has 95 states and 110 transitions. [2021-08-25 20:11:56,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,110 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 110 transitions. [2021-08-25 20:11:56,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:11:56,111 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,111 INFO L512 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] [2021-08-25 20:11:56,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-25 20:11:56,112 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1662125936, now seen corresponding path program 1 times [2021-08-25 20:11:56,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142462661] [2021-08-25 20:11:56,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,155 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,155 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142462661] [2021-08-25 20:11:56,156 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142462661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,156 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,156 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:56,156 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745989456] [2021-08-25 20:11:56,157 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:56,157 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:56,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,158 INFO L87 Difference]: Start difference. First operand 95 states and 110 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,186 INFO L93 Difference]: Finished difference Result 111 states and 129 transitions. [2021-08-25 20:11:56,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:56,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-25 20:11:56,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,188 INFO L225 Difference]: With dead ends: 111 [2021-08-25 20:11:56,188 INFO L226 Difference]: Without dead ends: 107 [2021-08-25 20:11:56,189 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2021-08-25 20:11:56,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2021-08-25 20:11:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.1649484536082475) internal successors, (113), 98 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2021-08-25 20:11:56,198 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 34 [2021-08-25 20:11:56,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,199 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2021-08-25 20:11:56,199 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,199 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2021-08-25 20:11:56,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2021-08-25 20:11:56,200 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,200 INFO L512 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] [2021-08-25 20:11:56,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-25 20:11:56,200 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,201 INFO L82 PathProgramCache]: Analyzing trace with hash -822248422, now seen corresponding path program 1 times [2021-08-25 20:11:56,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,201 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134514840] [2021-08-25 20:11:56,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,202 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,250 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134514840] [2021-08-25 20:11:56,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134514840] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:56,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720643106] [2021-08-25 20:11:56,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:56,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:56,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:56,253 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,288 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2021-08-25 20:11:56,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:56,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2021-08-25 20:11:56,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,289 INFO L225 Difference]: With dead ends: 112 [2021-08-25 20:11:56,289 INFO L226 Difference]: Without dead ends: 108 [2021-08-25 20:11:56,290 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.5ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:56,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2021-08-25 20:11:56,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 99. [2021-08-25 20:11:56,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.1443298969072164) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2021-08-25 20:11:56,297 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 34 [2021-08-25 20:11:56,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,297 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2021-08-25 20:11:56,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,298 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2021-08-25 20:11:56,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:11:56,298 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,298 INFO L512 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] [2021-08-25 20:11:56,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-25 20:11:56,300 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,301 INFO L82 PathProgramCache]: Analyzing trace with hash -21362253, now seen corresponding path program 1 times [2021-08-25 20:11:56,301 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,301 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [173214556] [2021-08-25 20:11:56,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,302 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,384 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,384 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [173214556] [2021-08-25 20:11:56,384 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [173214556] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,384 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,384 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-25 20:11:56,384 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294128544] [2021-08-25 20:11:56,385 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-25 20:11:56,385 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-25 20:11:56,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-25 20:11:56,386 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,419 INFO L93 Difference]: Finished difference Result 101 states and 112 transitions. [2021-08-25 20:11:56,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-25 20:11:56,419 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-25 20:11:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,420 INFO L225 Difference]: With dead ends: 101 [2021-08-25 20:11:56,420 INFO L226 Difference]: Without dead ends: 88 [2021-08-25 20:11:56,421 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:56,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-08-25 20:11:56,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-08-25 20:11:56,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.1162790697674418) internal successors, (96), 87 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2021-08-25 20:11:56,427 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 35 [2021-08-25 20:11:56,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,427 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2021-08-25 20:11:56,427 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,428 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2021-08-25 20:11:56,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:11:56,428 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,428 INFO L512 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] [2021-08-25 20:11:56,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-25 20:11:56,429 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,429 INFO L82 PathProgramCache]: Analyzing trace with hash 272561262, now seen corresponding path program 1 times [2021-08-25 20:11:56,429 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,429 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982032140] [2021-08-25 20:11:56,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,430 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,495 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982032140] [2021-08-25 20:11:56,496 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982032140] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,496 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,496 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-25 20:11:56,496 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774101792] [2021-08-25 20:11:56,497 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-25 20:11:56,497 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-25 20:11:56,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-25 20:11:56,498 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,533 INFO L93 Difference]: Finished difference Result 96 states and 104 transitions. [2021-08-25 20:11:56,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-25 20:11:56,534 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-25 20:11:56,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,534 INFO L225 Difference]: With dead ends: 96 [2021-08-25 20:11:56,534 INFO L226 Difference]: Without dead ends: 88 [2021-08-25 20:11:56,535 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 35.8ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-25 20:11:56,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2021-08-25 20:11:56,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2021-08-25 20:11:56,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 86 states have (on average 1.0930232558139534) internal successors, (94), 87 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2021-08-25 20:11:56,542 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 35 [2021-08-25 20:11:56,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,542 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2021-08-25 20:11:56,542 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,542 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2021-08-25 20:11:56,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2021-08-25 20:11:56,543 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,543 INFO L512 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] [2021-08-25 20:11:56,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-25 20:11:56,543 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1030061199, now seen corresponding path program 1 times [2021-08-25 20:11:56,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,544 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734592189] [2021-08-25 20:11:56,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,544 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,567 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,568 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734592189] [2021-08-25 20:11:56,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734592189] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,568 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,568 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:56,568 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237827785] [2021-08-25 20:11:56,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:56,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:56,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,570 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,581 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2021-08-25 20:11:56,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:56,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2021-08-25 20:11:56,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,582 INFO L225 Difference]: With dead ends: 106 [2021-08-25 20:11:56,582 INFO L226 Difference]: Without dead ends: 80 [2021-08-25 20:11:56,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2021-08-25 20:11:56,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2021-08-25 20:11:56,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 79 states have (on average 1.0506329113924051) internal successors, (83), 79 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 83 transitions. [2021-08-25 20:11:56,589 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 83 transitions. Word has length 35 [2021-08-25 20:11:56,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,589 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 83 transitions. [2021-08-25 20:11:56,590 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,590 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 83 transitions. [2021-08-25 20:11:56,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-08-25 20:11:56,590 INFO L504 BasicCegarLoop]: Found error trace [2021-08-25 20:11:56,590 INFO L512 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] [2021-08-25 20:11:56,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-25 20:11:56,591 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-08-25 20:11:56,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-25 20:11:56,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1765065444, now seen corresponding path program 1 times [2021-08-25 20:11:56,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-25 20:11:56,592 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326236314] [2021-08-25 20:11:56,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-25 20:11:56,592 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-25 20:11:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-25 20:11:56,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-25 20:11:56,617 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-25 20:11:56,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326236314] [2021-08-25 20:11:56,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326236314] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-25 20:11:56,618 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-25 20:11:56,618 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-25 20:11:56,618 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220657115] [2021-08-25 20:11:56,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-25 20:11:56,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-25 20:11:56,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-25 20:11:56,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,620 INFO L87 Difference]: Start difference. First operand 80 states and 83 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-25 20:11:56,633 INFO L93 Difference]: Finished difference Result 80 states and 83 transitions. [2021-08-25 20:11:56,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-25 20:11:56,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-08-25 20:11:56,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-25 20:11:56,634 INFO L225 Difference]: With dead ends: 80 [2021-08-25 20:11:56,634 INFO L226 Difference]: Without dead ends: 0 [2021-08-25 20:11:56,634 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-25 20:11:56,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-08-25 20:11:56,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-08-25 20:11:56,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-08-25 20:11:56,635 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2021-08-25 20:11:56,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-25 20:11:56,635 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-08-25 20:11:56,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-25 20:11:56,636 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-08-25 20:11:56,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-08-25 20:11:56,638 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,639 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,640 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,641 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,642 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,642 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,642 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,642 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,642 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,643 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,643 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,643 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,643 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,643 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,643 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-08-25 20:11:56,644 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-25 20:11:56,646 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-08-25 20:11:56,650 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,654 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,660 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,661 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,668 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,670 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,671 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,672 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,673 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,675 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,676 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,677 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,682 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,683 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,686 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,687 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,688 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,689 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,690 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,691 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,692 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,693 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,694 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,696 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,697 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,715 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,716 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,718 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,722 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,724 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,726 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,728 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,729 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,731 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,732 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,734 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,736 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,738 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,742 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,743 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,744 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,745 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,747 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,748 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,749 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,750 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,756 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,759 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,760 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,762 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,763 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,765 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,766 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,767 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,768 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,769 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,771 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,776 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,778 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,780 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,782 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,783 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,786 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,799 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,802 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,804 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,806 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,807 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,808 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,809 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,810 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,823 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,825 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,826 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,827 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,829 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,831 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,834 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,835 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,836 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,838 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,842 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,843 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,844 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,845 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,847 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,848 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,865 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,867 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,872 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,873 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,874 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,876 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:56,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-08-25 20:11:59,029 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,030 INFO L857 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2021-08-25 20:11:59,030 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,030 INFO L857 garLoopResultBuilder]: For program point L168(lines 168 271) no Hoare annotation was computed. [2021-08-25 20:11:59,030 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2021-08-25 20:11:59,030 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,030 INFO L857 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2021-08-25 20:11:59,031 INFO L857 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2021-08-25 20:11:59,031 INFO L857 garLoopResultBuilder]: For program point L368(lines 368 409) no Hoare annotation was computed. [2021-08-25 20:11:59,031 INFO L853 garLoopResultBuilder]: At program point L369(lines 368 409) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,031 INFO L853 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,032 INFO L857 garLoopResultBuilder]: For program point L700(lines 700 729) no Hoare annotation was computed. [2021-08-25 20:11:59,032 INFO L853 garLoopResultBuilder]: At program point L701(lines 700 729) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,032 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2021-08-25 20:11:59,032 INFO L857 garLoopResultBuilder]: For program point L504(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,032 INFO L857 garLoopResultBuilder]: For program point L504-1(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,032 INFO L857 garLoopResultBuilder]: For program point L504-2(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,032 INFO L857 garLoopResultBuilder]: For program point L504-3(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L857 garLoopResultBuilder]: For program point L504-4(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L857 garLoopResultBuilder]: For program point L504-5(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L857 garLoopResultBuilder]: For program point L504-6(lines 504 527) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L857 garLoopResultBuilder]: For program point L108(lines 108 291) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L857 garLoopResultBuilder]: For program point L769(lines 769 792) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L857 garLoopResultBuilder]: For program point L703(lines 703 728) no Hoare annotation was computed. [2021-08-25 20:11:59,033 INFO L853 garLoopResultBuilder]: At program point L505(lines 504 527) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,034 INFO L853 garLoopResultBuilder]: At program point L505-1(lines 504 527) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,034 INFO L853 garLoopResultBuilder]: At program point L505-2(lines 504 527) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (<= .cse0 0) (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (= ~NP~0 1) (= ~MPR1~0 ~s~0))) [2021-08-25 20:11:59,034 INFO L853 garLoopResultBuilder]: At program point L505-3(lines 504 527) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,034 INFO L857 garLoopResultBuilder]: For program point L373(lines 373 408) no Hoare annotation was computed. [2021-08-25 20:11:59,034 INFO L853 garLoopResultBuilder]: At program point L505-4(lines 504 527) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,035 INFO L853 garLoopResultBuilder]: At program point L505-5(lines 504 527) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,035 INFO L853 garLoopResultBuilder]: At program point L505-6(lines 504 527) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,035 INFO L853 garLoopResultBuilder]: At program point L109(lines 108 291) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,035 INFO L853 garLoopResultBuilder]: At program point L770(lines 769 792) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,035 INFO L857 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2021-08-25 20:11:59,035 INFO L857 garLoopResultBuilder]: For program point L638-1(lines 638 656) no Hoare annotation was computed. [2021-08-25 20:11:59,036 INFO L853 garLoopResultBuilder]: At program point L374(lines 373 408) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,036 INFO L857 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2021-08-25 20:11:59,036 INFO L853 garLoopResultBuilder]: At program point L573(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,036 INFO L853 garLoopResultBuilder]: At program point L573-1(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,036 INFO L853 garLoopResultBuilder]: At program point L573-2(lines 568 575) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ~setEventCalled~0 1) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1))) [2021-08-25 20:11:59,036 INFO L853 garLoopResultBuilder]: At program point L573-3(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,036 INFO L853 garLoopResultBuilder]: At program point L573-4(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,037 INFO L853 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2))) [2021-08-25 20:11:59,037 INFO L853 garLoopResultBuilder]: At program point L573-5(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,037 INFO L853 garLoopResultBuilder]: At program point L573-6(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,037 INFO L853 garLoopResultBuilder]: At program point L573-7(lines 568 575) the Hoare annotation is: false [2021-08-25 20:11:59,037 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2021-08-25 20:11:59,037 INFO L857 garLoopResultBuilder]: For program point L111(lines 111 290) no Hoare annotation was computed. [2021-08-25 20:11:59,038 INFO L857 garLoopResultBuilder]: For program point L706(lines 706 727) no Hoare annotation was computed. [2021-08-25 20:11:59,038 INFO L853 garLoopResultBuilder]: At program point L376(lines 375 408) the Hoare annotation is: (= ULTIMATE.start_main_~status~1 0) [2021-08-25 20:11:59,038 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,038 INFO L853 garLoopResultBuilder]: At program point L112(lines 111 290) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,038 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,038 INFO L857 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2021-08-25 20:11:59,038 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 641 655) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L509(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L509-1(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L509-2(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L509-3(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L509-4(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,039 INFO L857 garLoopResultBuilder]: For program point L509-5(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,040 INFO L857 garLoopResultBuilder]: For program point L509-6(lines 509 526) no Hoare annotation was computed. [2021-08-25 20:11:59,040 INFO L853 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,040 INFO L857 garLoopResultBuilder]: For program point L774(lines 774 791) no Hoare annotation was computed. [2021-08-25 20:11:59,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,040 INFO L853 garLoopResultBuilder]: At program point L576(lines 576 617) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0)) [2021-08-25 20:11:59,040 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,041 INFO L853 garLoopResultBuilder]: At program point L510(lines 509 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,041 INFO L853 garLoopResultBuilder]: At program point L510-1(lines 509 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,041 INFO L853 garLoopResultBuilder]: At program point L510-2(lines 509 526) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (<= .cse0 0) (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~MPR1~0 ~s~0))) [2021-08-25 20:11:59,041 INFO L853 garLoopResultBuilder]: At program point L510-3(lines 509 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,041 INFO L853 garLoopResultBuilder]: At program point L510-4(lines 509 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,041 INFO L853 garLoopResultBuilder]: At program point L510-5(lines 509 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,042 INFO L853 garLoopResultBuilder]: At program point L510-6(lines 509 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,042 INFO L857 garLoopResultBuilder]: For program point L114(lines 114 289) no Hoare annotation was computed. [2021-08-25 20:11:59,042 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,042 INFO L853 garLoopResultBuilder]: At program point L775(lines 774 791) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,042 INFO L857 garLoopResultBuilder]: For program point L709(lines 709 726) no Hoare annotation was computed. [2021-08-25 20:11:59,042 INFO L853 garLoopResultBuilder]: At program point L115(lines 114 289) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,042 INFO L857 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2021-08-25 20:11:59,043 INFO L857 garLoopResultBuilder]: For program point L644-1(lines 644 654) no Hoare annotation was computed. [2021-08-25 20:11:59,043 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,043 INFO L853 garLoopResultBuilder]: At program point L512(lines 511 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,043 INFO L853 garLoopResultBuilder]: At program point L512-1(lines 511 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,043 INFO L853 garLoopResultBuilder]: At program point L512-2(lines 511 526) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ~setEventCalled~0 1) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (<= .cse0 0) (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~MPR1~0 ~s~0))) [2021-08-25 20:11:59,043 INFO L853 garLoopResultBuilder]: At program point L512-3(lines 511 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,044 INFO L853 garLoopResultBuilder]: At program point L512-4(lines 511 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,044 INFO L853 garLoopResultBuilder]: At program point L512-5(lines 511 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,044 INFO L853 garLoopResultBuilder]: At program point L512-6(lines 511 526) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,044 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2021-08-25 20:11:59,044 INFO L853 garLoopResultBuilder]: At program point L182-1(lines 1 1016) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1))) [2021-08-25 20:11:59,045 INFO L853 garLoopResultBuilder]: At program point L777(lines 776 791) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,045 INFO L853 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,045 INFO L853 garLoopResultBuilder]: At program point L645-1(lines 638 656) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,045 INFO L857 garLoopResultBuilder]: For program point L117(lines 117 288) no Hoare annotation was computed. [2021-08-25 20:11:59,045 INFO L857 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2021-08-25 20:11:59,045 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2021-08-25 20:11:59,045 INFO L857 garLoopResultBuilder]: For program point L449(lines 449 457) no Hoare annotation was computed. [2021-08-25 20:11:59,046 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2021-08-25 20:11:59,046 INFO L857 garLoopResultBuilder]: For program point L450(lines 450 452) no Hoare annotation was computed. [2021-08-25 20:11:59,046 INFO L857 garLoopResultBuilder]: For program point L120(lines 120 287) no Hoare annotation was computed. [2021-08-25 20:11:59,046 INFO L853 garLoopResultBuilder]: At program point L54(lines 347 349) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,046 INFO L857 garLoopResultBuilder]: For program point L123(lines 123 286) no Hoare annotation was computed. [2021-08-25 20:11:59,046 INFO L857 garLoopResultBuilder]: For program point L454(lines 454 456) no Hoare annotation was computed. [2021-08-25 20:11:59,046 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-08-25 20:11:59,047 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,047 INFO L857 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2021-08-25 20:11:59,047 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,047 INFO L853 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,047 INFO L853 garLoopResultBuilder]: At program point L653-1(lines 641 655) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,047 INFO L857 garLoopResultBuilder]: For program point L126(lines 126 285) no Hoare annotation was computed. [2021-08-25 20:11:59,047 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,048 INFO L853 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (<= .cse0 0) (= ~s~0 ~NP~0) (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (= ~NP~0 1) (not (= ~MPR3~0 ~s~0)))) [2021-08-25 20:11:59,048 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,048 INFO L853 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,048 INFO L853 garLoopResultBuilder]: At program point L524-1(lines 488 552) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,048 INFO L853 garLoopResultBuilder]: At program point L524-2(lines 488 552) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (let ((.cse13 (not (= ~MPR3~0 1))) (.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse3 (<= 5 ~MPR1~0)) (.cse4 (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0)) (.cse5 (= 2 ~DC~0)) (.cse6 (= ULTIMATE.start_main_~status~1 0)) (.cse7 (<= 0 .cse15)) (.cse8 (not (= ~pended~0 1))) (.cse9 (not (= ~IPC~0 2))) (.cse10 (<= .cse15 0)) (.cse11 (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0))) (.cse12 (= ~NP~0 1)) (.cse14 (= ~MPR1~0 ~s~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse13 (<= (+ 1073741823 ULTIMATE.start_IofCallDriver_~returnVal2~0) 0) .cse14) (and .cse0 .cse1 (= ~setEventCalled~0 1) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse12 .cse13 .cse14) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) .cse6 .cse7 .cse8 .cse9 .cse10 .cse11 .cse12 .cse14)))) [2021-08-25 20:11:59,049 INFO L853 garLoopResultBuilder]: At program point L524-3(lines 488 552) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,049 INFO L853 garLoopResultBuilder]: At program point L524-4(lines 488 552) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,049 INFO L853 garLoopResultBuilder]: At program point L524-5(lines 488 552) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,049 INFO L853 garLoopResultBuilder]: At program point L524-6(lines 488 552) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,049 INFO L853 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,050 INFO L857 garLoopResultBuilder]: For program point L129(lines 129 284) no Hoare annotation was computed. [2021-08-25 20:11:59,050 INFO L853 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,050 INFO L857 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2021-08-25 20:11:59,050 INFO L857 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2021-08-25 20:11:59,050 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,050 INFO L857 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2021-08-25 20:11:59,051 INFO L853 garLoopResultBuilder]: At program point L594-1(lines 594 598) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0)) [2021-08-25 20:11:59,051 INFO L853 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2))) [2021-08-25 20:11:59,051 INFO L857 garLoopResultBuilder]: For program point L132(lines 132 283) no Hoare annotation was computed. [2021-08-25 20:11:59,051 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-08-25 20:11:59,051 INFO L857 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2021-08-25 20:11:59,051 INFO L853 garLoopResultBuilder]: At program point L662(lines 629 664) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,051 INFO L853 garLoopResultBuilder]: At program point L662-1(lines 629 664) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,052 INFO L860 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2021-08-25 20:11:59,052 INFO L857 garLoopResultBuilder]: For program point L135(lines 135 282) no Hoare annotation was computed. [2021-08-25 20:11:59,052 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,052 INFO L857 garLoopResultBuilder]: For program point L532-1(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,052 INFO L857 garLoopResultBuilder]: For program point L532-2(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,052 INFO L857 garLoopResultBuilder]: For program point L532-3(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,052 INFO L857 garLoopResultBuilder]: For program point L532-4(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point L532-5(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point L532-6(lines 532 549) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point L533(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point L533-3(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,053 INFO L857 garLoopResultBuilder]: For program point L533-6(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L853 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2))) [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point L533-9(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point L533-12(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point L533-15(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point L533-18(lines 533 539) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point L138(lines 138 281) no Hoare annotation was computed. [2021-08-25 20:11:59,054 INFO L857 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point L800(lines 800 806) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point L603(lines 603 615) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point L471-2(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point L339(lines 339 342) no Hoare annotation was computed. [2021-08-25 20:11:59,055 INFO L857 garLoopResultBuilder]: For program point L471-4(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L339-2(lines 339 342) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L471-6(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L207(lines 207 213) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L471-8(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L141(lines 141 280) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L471-10(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L471-12(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,056 INFO L857 garLoopResultBuilder]: For program point L471-14(lines 471 477) no Hoare annotation was computed. [2021-08-25 20:11:59,057 INFO L857 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2021-08-25 20:11:59,057 INFO L853 garLoopResultBuilder]: At program point L604(lines 603 615) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0)) [2021-08-25 20:11:59,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,057 INFO L857 garLoopResultBuilder]: For program point L208(lines 208 212) no Hoare annotation was computed. [2021-08-25 20:11:59,057 INFO L853 garLoopResultBuilder]: At program point L76(lines 330 413) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0)) (not (= ~s~0 1))) [2021-08-25 20:11:59,057 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,058 INFO L853 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,058 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,058 INFO L853 garLoopResultBuilder]: At program point L606(lines 605 615) the Hoare annotation is: (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0)) [2021-08-25 20:11:59,058 INFO L857 garLoopResultBuilder]: For program point L144(lines 144 279) no Hoare annotation was computed. [2021-08-25 20:11:59,058 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,058 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,058 INFO L857 garLoopResultBuilder]: For program point L541-2(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L541-4(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L541-6(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L541-8(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L541-10(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L541-12(lines 541 548) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2021-08-25 20:11:59,059 INFO L857 garLoopResultBuilder]: For program point L674-2(lines 674 680) no Hoare annotation was computed. [2021-08-25 20:11:59,060 INFO L857 garLoopResultBuilder]: For program point L674-4(lines 674 680) no Hoare annotation was computed. [2021-08-25 20:11:59,060 INFO L853 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,060 INFO L857 garLoopResultBuilder]: For program point L147(lines 147 278) no Hoare annotation was computed. [2021-08-25 20:11:59,060 INFO L857 garLoopResultBuilder]: For program point L940(lines 940 943) no Hoare annotation was computed. [2021-08-25 20:11:59,060 INFO L853 garLoopResultBuilder]: At program point L742(lines 689 744) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,060 INFO L857 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2021-08-25 20:11:59,060 INFO L857 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point L150(lines 150 277) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point L153(lines 153 276) no Hoare annotation was computed. [2021-08-25 20:11:59,061 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point L1013(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point L1013-1(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point L1013-2(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point L1013-3(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point L1013-4(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,062 INFO L857 garLoopResultBuilder]: For program point L1013-5(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-6(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-7(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-8(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-9(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-10(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-11(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,063 INFO L857 garLoopResultBuilder]: For program point L1013-12(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,064 INFO L857 garLoopResultBuilder]: For program point L1013-13(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,064 INFO L853 garLoopResultBuilder]: At program point L551(lines 481 553) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,064 INFO L857 garLoopResultBuilder]: For program point L1013-14(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,064 INFO L853 garLoopResultBuilder]: At program point L551-1(lines 481 553) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,064 INFO L857 garLoopResultBuilder]: For program point L1013-15(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,064 INFO L853 garLoopResultBuilder]: At program point L551-2(lines 481 553) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (let ((.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse8 (<= 5 ~MPR1~0)) (.cse9 (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (<= 0 .cse15)) (.cse5 (not (= ~pended~0 1))) (.cse6 (not (= ~IPC~0 2))) (.cse11 (<= .cse15 0)) (.cse7 (= ~s~0 ~NP~0)) (.cse12 (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0))) (.cse13 (= ~NP~0 1)) (.cse14 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) .cse4 (= |ULTIMATE.start_IofCallDriver_#res| 0) .cse5 .cse6 .cse7) (and .cse0 .cse1 (= ~setEventCalled~0 1) .cse2 .cse8 .cse9 .cse3 (<= 259 |ULTIMATE.start_IofCallDriver_#res|) .cse4 .cse10 .cse5 .cse6 .cse11 .cse12 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= |ULTIMATE.start_IofCallDriver_#res| 259) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse13 .cse14 (= ~MPR3~0 ~s~0)) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse7 .cse12 .cse13 .cse14)))) [2021-08-25 20:11:59,065 INFO L857 garLoopResultBuilder]: For program point L1013-16(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,065 INFO L853 garLoopResultBuilder]: At program point L551-3(lines 481 553) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,065 INFO L857 garLoopResultBuilder]: For program point L1013-17(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,065 INFO L853 garLoopResultBuilder]: At program point L551-4(lines 481 553) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,065 INFO L857 garLoopResultBuilder]: For program point L1013-18(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,065 INFO L857 garLoopResultBuilder]: For program point L1013-19(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,066 INFO L853 garLoopResultBuilder]: At program point L551-5(lines 481 553) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,066 INFO L857 garLoopResultBuilder]: For program point L353(lines 353 412) no Hoare annotation was computed. [2021-08-25 20:11:59,066 INFO L857 garLoopResultBuilder]: For program point L1013-20(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,066 INFO L853 garLoopResultBuilder]: At program point L551-6(lines 481 553) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,066 INFO L857 garLoopResultBuilder]: For program point L1013-21(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,066 INFO L857 garLoopResultBuilder]: For program point L1013-22(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,066 INFO L857 garLoopResultBuilder]: For program point L1013-23(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,067 INFO L857 garLoopResultBuilder]: For program point L1013-24(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,067 INFO L857 garLoopResultBuilder]: For program point L1013-25(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,067 INFO L857 garLoopResultBuilder]: For program point L1013-26(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,067 INFO L857 garLoopResultBuilder]: For program point L1013-27(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,067 INFO L857 garLoopResultBuilder]: For program point L1013-28(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,067 INFO L853 garLoopResultBuilder]: At program point L1014(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,067 INFO L853 garLoopResultBuilder]: At program point L1014-2(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,068 INFO L853 garLoopResultBuilder]: At program point L1014-3(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,068 INFO L853 garLoopResultBuilder]: At program point L1014-5(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,068 INFO L853 garLoopResultBuilder]: At program point L1014-9(lines 1 1016) the Hoare annotation is: (let ((.cse15 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (let ((.cse7 (= ~s~0 ~NP~0)) (.cse0 (= ~compRegistered~0 1)) (.cse1 (not (= ~SKIP2~0 2))) (.cse2 (= ULTIMATE.start_KbFilter_PnP_~status~0 0)) (.cse8 (<= 5 ~MPR1~0)) (.cse9 (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0)) (.cse3 (= 2 ~DC~0)) (.cse4 (= ULTIMATE.start_main_~status~1 0)) (.cse10 (<= 0 .cse15)) (.cse5 (not (= ~pended~0 1))) (.cse6 (not (= ~IPC~0 2))) (.cse11 (<= .cse15 0)) (.cse12 (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0))) (.cse13 (= ~NP~0 1)) (.cse14 (not (= ~MPR3~0 1)))) (or (and .cse0 .cse1 .cse2 .cse3 (= ULTIMATE.start_IofCallDriver_~returnVal2~0 0) .cse4 .cse5 .cse6 .cse7) (and .cse0 .cse1 .cse2 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse7 .cse12 .cse13 .cse14) (and .cse0 .cse1 (= ~setEventCalled~0 1) .cse2 .cse8 .cse9 .cse3 .cse4 .cse10 .cse5 .cse6 .cse11 .cse12 (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259) .cse13 .cse14 (= ~MPR3~0 ~s~0))))) [2021-08-25 20:11:59,068 INFO L853 garLoopResultBuilder]: At program point L1014-12(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,068 INFO L853 garLoopResultBuilder]: At program point L1014-14(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,068 INFO L853 garLoopResultBuilder]: At program point L1014-15(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,069 INFO L853 garLoopResultBuilder]: At program point L1014-17(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,069 INFO L853 garLoopResultBuilder]: At program point L1014-18(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,069 INFO L853 garLoopResultBuilder]: At program point L354(lines 353 412) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,069 INFO L853 garLoopResultBuilder]: At program point L1014-20(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,069 INFO L853 garLoopResultBuilder]: At program point L1014-21(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,069 INFO L853 garLoopResultBuilder]: At program point L1014-23(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,070 INFO L853 garLoopResultBuilder]: At program point L1014-24(lines 554 567) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (= 2 ~s~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,070 INFO L853 garLoopResultBuilder]: At program point L1014-25(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,070 INFO L857 garLoopResultBuilder]: For program point L156(lines 156 275) no Hoare annotation was computed. [2021-08-25 20:11:59,070 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,070 INFO L853 garLoopResultBuilder]: At program point L1014-27(lines 1 1016) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,070 INFO L857 garLoopResultBuilder]: For program point L883(lines 883 988) no Hoare annotation was computed. [2021-08-25 20:11:59,071 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,071 INFO L853 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2))) [2021-08-25 20:11:59,071 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2021-08-25 20:11:59,071 INFO L853 garLoopResultBuilder]: At program point L884(lines 883 988) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,071 INFO L853 garLoopResultBuilder]: At program point L686(lines 665 688) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,071 INFO L853 garLoopResultBuilder]: At program point L686-1(lines 665 688) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,072 INFO L853 garLoopResultBuilder]: At program point L686-2(lines 665 688) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,072 INFO L853 garLoopResultBuilder]: At program point L819(lines 745 821) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,072 INFO L857 garLoopResultBuilder]: For program point L489(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,072 INFO L853 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,072 INFO L857 garLoopResultBuilder]: For program point L489-2(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,072 INFO L857 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-08-25 20:11:59,072 INFO L853 garLoopResultBuilder]: At program point L489-3(lines 489 501) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,073 INFO L857 garLoopResultBuilder]: For program point L489-4(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,073 INFO L853 garLoopResultBuilder]: At program point L489-5(lines 489 501) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ~setEventCalled~0 1) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (<= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (<= .cse0 0) (< 0 (+ 1073741803 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0)) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~MPR1~0 ~s~0))) [2021-08-25 20:11:59,073 INFO L857 garLoopResultBuilder]: For program point L489-6(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,073 INFO L853 garLoopResultBuilder]: At program point L489-7(lines 489 501) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,073 INFO L857 garLoopResultBuilder]: For program point L489-8(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,073 INFO L853 garLoopResultBuilder]: At program point L489-9(lines 489 501) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,074 INFO L857 garLoopResultBuilder]: For program point L159(lines 159 274) no Hoare annotation was computed. [2021-08-25 20:11:59,074 INFO L857 garLoopResultBuilder]: For program point L489-10(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,074 INFO L853 garLoopResultBuilder]: At program point L489-11(lines 489 501) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,074 INFO L857 garLoopResultBuilder]: For program point L489-12(lines 489 501) no Hoare annotation was computed. [2021-08-25 20:11:59,074 INFO L853 garLoopResultBuilder]: At program point L489-13(lines 489 501) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,074 INFO L857 garLoopResultBuilder]: For program point L754(lines 754 766) no Hoare annotation was computed. [2021-08-25 20:11:59,074 INFO L853 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,075 INFO L857 garLoopResultBuilder]: For program point L358(lines 358 411) no Hoare annotation was computed. [2021-08-25 20:11:59,075 INFO L853 garLoopResultBuilder]: At program point L292(lines 81 294) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2))) [2021-08-25 20:11:59,075 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2021-08-25 20:11:59,075 INFO L853 garLoopResultBuilder]: At program point L359(lines 358 411) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,075 INFO L857 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2021-08-25 20:11:59,075 INFO L857 garLoopResultBuilder]: For program point L558-2(lines 558 564) no Hoare annotation was computed. [2021-08-25 20:11:59,075 INFO L857 garLoopResultBuilder]: For program point L162(lines 162 273) no Hoare annotation was computed. [2021-08-25 20:11:59,076 INFO L857 garLoopResultBuilder]: For program point L956(lines 956 958) no Hoare annotation was computed. [2021-08-25 20:11:59,076 INFO L857 garLoopResultBuilder]: For program point L956-2(lines 934 971) no Hoare annotation was computed. [2021-08-25 20:11:59,076 INFO L853 garLoopResultBuilder]: At program point L626(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,076 INFO L853 garLoopResultBuilder]: At program point L626-1(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,076 INFO L853 garLoopResultBuilder]: At program point L626-2(lines 618 628) the Hoare annotation is: (let ((.cse0 (+ |ULTIMATE.start_KbFilter_Complete_#res| 1073741802))) (and (= ~compRegistered~0 1) (not (= ~SKIP2~0 2)) (= ~setEventCalled~0 1) (= ULTIMATE.start_KbFilter_PnP_~status~0 0) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (<= 0 .cse0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (<= .cse0 0) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1)))) [2021-08-25 20:11:59,076 INFO L853 garLoopResultBuilder]: At program point L626-3(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,076 INFO L853 garLoopResultBuilder]: At program point L626-4(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,077 INFO L853 garLoopResultBuilder]: At program point L626-5(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,077 INFO L853 garLoopResultBuilder]: At program point L626-6(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,077 INFO L853 garLoopResultBuilder]: At program point L626-7(lines 618 628) the Hoare annotation is: false [2021-08-25 20:11:59,077 INFO L857 garLoopResultBuilder]: For program point L891(lines 891 986) no Hoare annotation was computed. [2021-08-25 20:11:59,077 INFO L857 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,077 INFO L857 garLoopResultBuilder]: For program point L495-2(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,077 INFO L853 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (not (= ~pended~0 1)) (not (= ~IPC~0 2))) [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L363(lines 363 410) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L495-4(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L495-6(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L495-8(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L165(lines 165 272) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L495-10(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L857 garLoopResultBuilder]: For program point L495-12(lines 495 499) no Hoare annotation was computed. [2021-08-25 20:11:59,078 INFO L853 garLoopResultBuilder]: At program point L892(lines 891 986) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,079 INFO L857 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2021-08-25 20:11:59,079 INFO L860 garLoopResultBuilder]: At program point L430(lines 414 463) the Hoare annotation is: true [2021-08-25 20:11:59,079 INFO L853 garLoopResultBuilder]: At program point L364(lines 363 410) the Hoare annotation is: (and (not (= ~SKIP2~0 2)) (<= 5 ~MPR1~0) (= 2 ~DC~0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (not (= ~IPC~0 2)) (= ~s~0 ~NP~0) (= ~NP~0 1) (not (= ~MPR3~0 1)) (= ~compRegistered~0 0)) [2021-08-25 20:11:59,079 INFO L857 garLoopResultBuilder]: For program point L959-1(lines 959 961) no Hoare annotation was computed. [2021-08-25 20:11:59,079 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,079 INFO L857 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2021-08-25 20:11:59,079 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-08-25 20:11:59,083 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-25 20:11:59,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.08 08:11:59 BoogieIcfgContainer [2021-08-25 20:11:59,119 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-25 20:11:59,120 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-25 20:11:59,120 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-25 20:11:59,120 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-25 20:11:59,121 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.08 08:11:53" (3/4) ... [2021-08-25 20:11:59,123 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-08-25 20:11:59,148 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 60 nodes and edges [2021-08-25 20:11:59,150 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 39 nodes and edges [2021-08-25 20:11:59,151 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-08-25 20:11:59,153 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-08-25 20:11:59,178 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && MPR1 == s [2021-08-25 20:11:59,179 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && MPR1 == s [2021-08-25 20:11:59,179 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && 1073741823 + returnVal2 <= 0) && MPR1 == s) || (((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && returnVal2 <= 259) && NP == 1) && !(MPR3 == 1)) && MPR1 == s)) || ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && returnVal2 == 0) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && MPR1 == s) [2021-08-25 20:11:59,180 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 2 == DC) && returnVal2 == 0) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) || ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1))) || (((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && returnVal2 <= 259) && NP == 1) && !(MPR3 == 1)) && MPR3 == s) [2021-08-25 20:11:59,180 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 2 == DC) && returnVal2 == 0) && status == 0) && \result == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) || (((((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && 259 <= \result) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && \result <= 259) && returnVal2 <= 259) && NP == 1) && !(MPR3 == 1)) && MPR3 == s)) || ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) [2021-08-25 20:11:59,180 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && MPR1 == s [2021-08-25 20:11:59,180 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && MPR1 == s [2021-08-25 20:11:59,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && NP == 1) && !(MPR3 == 1) [2021-08-25 20:11:59,181 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == s) [2021-08-25 20:11:59,269 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-25 20:11:59,269 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-25 20:11:59,270 INFO L168 Benchmark]: Toolchain (without parser) took 7466.96 ms. Allocated memory was 65.0 MB in the beginning and 211.8 MB in the end (delta: 146.8 MB). Free memory was 44.7 MB in the beginning and 129.8 MB in the end (delta: -85.1 MB). Peak memory consumption was 62.0 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,270 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 65.0 MB. Free memory is still 47.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-08-25 20:11:59,271 INFO L168 Benchmark]: CACSL2BoogieTranslator took 461.96 ms. Allocated memory is still 65.0 MB. Free memory was 44.5 MB in the beginning and 42.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,271 INFO L168 Benchmark]: Boogie Procedure Inliner took 105.76 ms. Allocated memory is still 65.0 MB. Free memory was 42.3 MB in the beginning and 36.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,271 INFO L168 Benchmark]: Boogie Preprocessor took 85.78 ms. Allocated memory is still 65.0 MB. Free memory was 36.1 MB in the beginning and 32.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,271 INFO L168 Benchmark]: RCFGBuilder took 1074.27 ms. Allocated memory was 65.0 MB in the beginning and 104.9 MB in the end (delta: 39.8 MB). Free memory was 32.1 MB in the beginning and 79.4 MB in the end (delta: -47.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,272 INFO L168 Benchmark]: TraceAbstraction took 5583.53 ms. Allocated memory was 104.9 MB in the beginning and 211.8 MB in the end (delta: 107.0 MB). Free memory was 78.7 MB in the beginning and 157.3 MB in the end (delta: -78.6 MB). Peak memory consumption was 123.1 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,272 INFO L168 Benchmark]: Witness Printer took 149.03 ms. Allocated memory is still 211.8 MB. Free memory was 156.3 MB in the beginning and 129.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. [2021-08-25 20:11:59,273 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 65.0 MB. Free memory is still 47.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 461.96 ms. Allocated memory is still 65.0 MB. Free memory was 44.5 MB in the beginning and 42.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 105.76 ms. Allocated memory is still 65.0 MB. Free memory was 42.3 MB in the beginning and 36.1 MB in the end (delta: 6.2 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 85.78 ms. Allocated memory is still 65.0 MB. Free memory was 36.1 MB in the beginning and 32.3 MB in the end (delta: 3.8 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1074.27 ms. Allocated memory was 65.0 MB in the beginning and 104.9 MB in the end (delta: 39.8 MB). Free memory was 32.1 MB in the beginning and 79.4 MB in the end (delta: -47.3 MB). Peak memory consumption was 23.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5583.53 ms. Allocated memory was 104.9 MB in the beginning and 211.8 MB in the end (delta: 107.0 MB). Free memory was 78.7 MB in the beginning and 157.3 MB in the end (delta: -78.6 MB). Peak memory consumption was 123.1 MB. Max. memory is 16.1 GB. * Witness Printer took 149.03 ms. Allocated memory is still 211.8 MB. Free memory was 156.3 MB in the beginning and 129.8 MB in the end (delta: 26.5 MB). Peak memory consumption was 27.3 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 328 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 5498.6ms, OverallIterations: 21, TraceHistogramMax: 1, EmptinessCheckTime: 29.3ms, AutomataDifference: 1292.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 2384.8ms, InitialAbstractionConstructionTime: 14.4ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3866 SDtfs, 2621 SDslu, 2244 SDs, 0 SdLazy, 695 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 590.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 92 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 242.0ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=347occurred in iteration=2, InterpolantAutomatonStates: 76, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 294.7ms AutomataMinimizationTime, 21 MinimizatonAttempts, 149 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0ms HoareAnnotationTime, 123 LocationsWithAnnotation, 123 PreInvPairs, 266 NumberOfFragments, 3261 HoareAnnotationTreeSize, 123 FomulaSimplifications, 3024 FormulaSimplificationTreeSizeReduction, 227.5ms HoareSimplificationTime, 123 FomulaSimplificationsInter, 677 FormulaSimplificationTreeSizeReductionInter, 2123.8ms HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 82.7ms SsaConstructionTime, 245.8ms SatisfiabilityAnalysisTime, 818.5ms InterpolantComputationTime, 598 NumberOfCodeBlocks, 598 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 577 ConstructedInterpolants, 0 QuantifiedInterpolants, 1544 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && MPR1 == s - InvariantResult [Line: 375]: Loop Invariant Derived loop invariant: status == 0 - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == s) - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 605]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 774]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: ((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 776]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: ((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2) - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 2 == DC) && returnVal2 == 0) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) || ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1))) || (((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && returnVal2 <= 259) && NP == 1) && !(MPR3 == 1)) && MPR3 == s) - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 689]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 594]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 603]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 745]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 769]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: ((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2) - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: ((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && NP == 1) && !(MPR3 == 1) - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && NP == 1) && !(MPR3 == 1)) && compRegistered == 0) && !(MPR3 == s)) && !(s == 1) - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: ((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && NP == 1) && !(MPR3 == 1)) && compRegistered == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: ((!(SKIP2 == 2) && 2 == DC) && !(pended == 1)) && !(IPC == 2) - InvariantResult [Line: 629]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 509]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && !(SKIP2 == 2)) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 81]: Loop Invariant Derived loop invariant: (((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2) - InvariantResult [Line: 511]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: ((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && MPR1 == s - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 665]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: ((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && 1073741823 + returnVal2 <= 0) && MPR1 == s) || (((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && returnVal2 <= 259) && NP == 1) && !(MPR3 == 1)) && MPR1 == s)) || ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && returnVal2 == 0) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && MPR1 == s) - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && NP == 1) && !(MPR3 == 1) - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((((((((!(SKIP2 == 2) && status == 0) && 5 <= MPR1) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && NP == 1) && !(MPR3 == 1)) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 568]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 504]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 700]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: ((((((((!(SKIP2 == 2) && 5 <= MPR1) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && NP == 1) && !(MPR3 == 1)) && compRegistered == 0 - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 2 == DC) && returnVal2 == 0) && status == 0) && \result == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) || (((((((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && 259 <= \result) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && 259 <= returnVal2) && \result <= 259) && returnVal2 <= 259) && NP == 1) && !(MPR3 == 1)) && MPR3 == s)) || ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && s == NP) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: ((((((((((((((compRegistered == 1 && !(SKIP2 == 2)) && setEventCalled == 1) && status == 0) && 5 <= MPR1) && 1073741802 + __cil_tmp7 <= 0) && 2 == DC) && status == 0) && 0 <= \result + 1073741802) && !(pended == 1)) && !(IPC == 2)) && \result + 1073741802 <= 0) && 0 < 1073741803 + __cil_tmp7) && NP == 1) && !(MPR3 == 1)) && MPR1 == s - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && 2 == s) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 481]: Loop Invariant Derived loop invariant: ((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((((((((compRegistered == 1 && !(SKIP2 == 2)) && status == 0) && 5 <= MPR1) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && NP == 1) && !(MPR3 == 1) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((((!(SKIP2 == 2) && 2 == DC) && status == 0) && !(pended == 1)) && !(IPC == 2)) && s == NP) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-08-25 20:11:59,327 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...