./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 18:59:05,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 18:59:05,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 18:59:05,372 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 18:59:05,372 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 18:59:05,373 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 18:59:05,373 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 18:59:05,375 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 18:59:05,375 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 18:59:05,376 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 18:59:05,376 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 18:59:05,377 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 18:59:05,377 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 18:59:05,378 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 18:59:05,378 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 18:59:05,379 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 18:59:05,379 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 18:59:05,380 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 18:59:05,381 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 18:59:05,382 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 18:59:05,382 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 18:59:05,383 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 18:59:05,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 18:59:05,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 18:59:05,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 18:59:05,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 18:59:05,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 18:59:05,386 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 18:59:05,386 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 18:59:05,387 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 18:59:05,387 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 18:59:05,387 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 18:59:05,388 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 18:59:05,388 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 18:59:05,388 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 18:59:05,389 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 18:59:05,389 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 18:59:05,396 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 18:59:05,396 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 18:59:05,397 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 18:59:05,397 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 18:59:05,397 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 18:59:05,397 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 18:59:05,397 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 18:59:05,397 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 18:59:05,397 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 18:59:05,397 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 18:59:05,398 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 18:59:05,398 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 18:59:05,398 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 18:59:05,398 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 18:59:05,398 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 18:59:05,398 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 18:59:05,398 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 18:59:05,399 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 18:59:05,399 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:59:05,400 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 18:59:05,400 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan 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 -> 41f85ef13c9e2b840fcfc019d39f6b7e23aee02e [2018-12-08 18:59:05,417 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 18:59:05,424 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 18:59:05,426 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 18:59:05,427 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 18:59:05,427 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 18:59:05,427 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 18:59:05,464 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/data/573c880ad/1ba56bdae4024e9f8ab838fe9e7309e6/FLAGd92d42e40 [2018-12-08 18:59:05,901 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 18:59:05,902 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 18:59:05,906 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/data/573c880ad/1ba56bdae4024e9f8ab838fe9e7309e6/FLAGd92d42e40 [2018-12-08 18:59:05,914 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/data/573c880ad/1ba56bdae4024e9f8ab838fe9e7309e6 [2018-12-08 18:59:05,916 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 18:59:05,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 18:59:05,918 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 18:59:05,918 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 18:59:05,920 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 18:59:05,920 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:59:05" (1/1) ... [2018-12-08 18:59:05,922 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a48a216 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:05, skipping insertion in model container [2018-12-08 18:59:05,922 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 06:59:05" (1/1) ... [2018-12-08 18:59:05,926 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 18:59:05,944 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 18:59:06,054 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:59:06,057 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 18:59:06,083 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 18:59:06,093 INFO L195 MainTranslator]: Completed translation [2018-12-08 18:59:06,093 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06 WrapperNode [2018-12-08 18:59:06,093 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 18:59:06,094 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 18:59:06,094 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 18:59:06,094 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 18:59:06,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,104 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,138 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 18:59:06,138 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 18:59:06,138 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 18:59:06,139 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 18:59:06,145 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,147 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,147 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,153 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,158 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... [2018-12-08 18:59:06,160 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 18:59:06,161 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 18:59:06,161 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 18:59:06,161 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 18:59:06,161 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 18:59:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure KeSetEvent [2018-12-08 18:59:06,197 INFO L138 BoogieDeclarations]: Found implementation of procedure KeSetEvent [2018-12-08 18:59:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_Complete [2018-12-08 18:59:06,197 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_Complete [2018-12-08 18:59:06,197 INFO L130 BoogieDeclarations]: Found specification of procedure stub_driver_init [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure stub_driver_init [2018-12-08 18:59:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure _BLAST_init [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure _BLAST_init [2018-12-08 18:59:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure errorFn [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure errorFn [2018-12-08 18:59:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 18:59:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure IofCallDriver [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCallDriver [2018-12-08 18:59:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure stubMoreProcessingRequired [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure stubMoreProcessingRequired [2018-12-08 18:59:06,198 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 18:59:06,198 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 18:59:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure KeWaitForSingleObject [2018-12-08 18:59:06,199 INFO L138 BoogieDeclarations]: Found implementation of procedure KeWaitForSingleObject [2018-12-08 18:59:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure IofCompleteRequest [2018-12-08 18:59:06,199 INFO L138 BoogieDeclarations]: Found implementation of procedure IofCompleteRequest [2018-12-08 18:59:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 18:59:06,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 18:59:06,199 INFO L130 BoogieDeclarations]: Found specification of procedure KbFilter_PnP [2018-12-08 18:59:06,199 INFO L138 BoogieDeclarations]: Found implementation of procedure KbFilter_PnP [2018-12-08 18:59:06,301 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 18:59:06,301 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 18:59:06,365 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 18:59:06,365 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 18:59:06,394 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 18:59:06,394 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 18:59:06,411 WARN L650 $ProcedureCfgBuilder]: Two Gotos in a row! There was dead code [2018-12-08 18:59:06,412 WARN L615 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2018-12-08 18:59:06,475 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 18:59:06,475 INFO L280 CfgBuilder]: Removed 0 assue(true) statements. [2018-12-08 18:59:06,476 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:59:06 BoogieIcfgContainer [2018-12-08 18:59:06,476 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 18:59:06,476 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 18:59:06,476 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 18:59:06,478 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 18:59:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 06:59:05" (1/3) ... [2018-12-08 18:59:06,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6821c0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:59:06, skipping insertion in model container [2018-12-08 18:59:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 06:59:06" (2/3) ... [2018-12-08 18:59:06,479 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6821c0f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 06:59:06, skipping insertion in model container [2018-12-08 18:59:06,479 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:59:06" (3/3) ... [2018-12-08 18:59:06,481 INFO L112 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl1_true-unreach-call_true-valid-memsafety_true-termination.cil.c [2018-12-08 18:59:06,487 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 18:59:06,492 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 18:59:06,503 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 18:59:06,523 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 18:59:06,523 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 18:59:06,523 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 18:59:06,523 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 18:59:06,523 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 18:59:06,523 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 18:59:06,524 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 18:59:06,524 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 18:59:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states. [2018-12-08 18:59:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 18:59:06,539 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:06,540 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:06,541 INFO L423 AbstractCegarLoop]: === Iteration 1 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:06,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:06,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1530382191, now seen corresponding path program 1 times [2018-12-08 18:59:06,546 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:06,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:06,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:06,575 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:06,575 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:06,668 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:06,669 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:06,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:06,670 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:06,673 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:06,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:06,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:06,682 INFO L87 Difference]: Start difference. First operand 151 states. Second operand 3 states. [2018-12-08 18:59:06,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:06,720 INFO L93 Difference]: Finished difference Result 286 states and 438 transitions. [2018-12-08 18:59:06,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:06,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-08 18:59:06,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:06,728 INFO L225 Difference]: With dead ends: 286 [2018-12-08 18:59:06,728 INFO L226 Difference]: Without dead ends: 140 [2018-12-08 18:59:06,731 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-12-08 18:59:06,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2018-12-08 18:59:06,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-08 18:59:06,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 190 transitions. [2018-12-08 18:59:06,759 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 190 transitions. Word has length 20 [2018-12-08 18:59:06,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:06,760 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 190 transitions. [2018-12-08 18:59:06,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:06,760 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 190 transitions. [2018-12-08 18:59:06,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-12-08 18:59:06,760 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:06,760 INFO L402 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] [2018-12-08 18:59:06,761 INFO L423 AbstractCegarLoop]: === Iteration 2 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:06,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:06,761 INFO L82 PathProgramCache]: Analyzing trace with hash 1141575010, now seen corresponding path program 1 times [2018-12-08 18:59:06,761 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:06,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:06,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:06,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:06,762 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:06,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:06,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:06,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:06,837 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:06,837 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:06,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:06,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:06,838 INFO L87 Difference]: Start difference. First operand 140 states and 190 transitions. Second operand 3 states. [2018-12-08 18:59:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:06,908 INFO L93 Difference]: Finished difference Result 258 states and 346 transitions. [2018-12-08 18:59:06,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:06,909 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2018-12-08 18:59:06,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:06,910 INFO L225 Difference]: With dead ends: 258 [2018-12-08 18:59:06,910 INFO L226 Difference]: Without dead ends: 202 [2018-12-08 18:59:06,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-08 18:59:06,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 189. [2018-12-08 18:59:06,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-12-08 18:59:06,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 252 transitions. [2018-12-08 18:59:06,922 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 252 transitions. Word has length 26 [2018-12-08 18:59:06,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:06,923 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 252 transitions. [2018-12-08 18:59:06,923 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:06,923 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 252 transitions. [2018-12-08 18:59:06,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-08 18:59:06,923 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:06,923 INFO L402 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] [2018-12-08 18:59:06,923 INFO L423 AbstractCegarLoop]: === Iteration 3 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:06,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:06,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1029098174, now seen corresponding path program 1 times [2018-12-08 18:59:06,924 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:06,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:06,924 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:06,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:06,924 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:06,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:06,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:06,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:59:06,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:06,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:59:06,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:59:06,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:59:06,999 INFO L87 Difference]: Start difference. First operand 189 states and 252 transitions. Second operand 4 states. [2018-12-08 18:59:07,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,040 INFO L93 Difference]: Finished difference Result 310 states and 406 transitions. [2018-12-08 18:59:07,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:59:07,041 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2018-12-08 18:59:07,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,043 INFO L225 Difference]: With dead ends: 310 [2018-12-08 18:59:07,043 INFO L226 Difference]: Without dead ends: 248 [2018-12-08 18:59:07,044 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:59:07,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-12-08 18:59:07,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 211. [2018-12-08 18:59:07,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-08 18:59:07,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 282 transitions. [2018-12-08 18:59:07,059 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 282 transitions. Word has length 27 [2018-12-08 18:59:07,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,059 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 282 transitions. [2018-12-08 18:59:07,060 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:59:07,060 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 282 transitions. [2018-12-08 18:59:07,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-08 18:59:07,060 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,061 INFO L402 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] [2018-12-08 18:59:07,061 INFO L423 AbstractCegarLoop]: === Iteration 4 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,061 INFO L82 PathProgramCache]: Analyzing trace with hash 742933031, now seen corresponding path program 1 times [2018-12-08 18:59:07,061 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,062 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,137 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:59:07,137 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,137 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:59:07,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:59:07,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:59:07,138 INFO L87 Difference]: Start difference. First operand 211 states and 282 transitions. Second operand 4 states. [2018-12-08 18:59:07,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,229 INFO L93 Difference]: Finished difference Result 214 states and 284 transitions. [2018-12-08 18:59:07,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 18:59:07,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 37 [2018-12-08 18:59:07,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,231 INFO L225 Difference]: With dead ends: 214 [2018-12-08 18:59:07,231 INFO L226 Difference]: Without dead ends: 211 [2018-12-08 18:59:07,232 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:59:07,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-12-08 18:59:07,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-12-08 18:59:07,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-12-08 18:59:07,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 281 transitions. [2018-12-08 18:59:07,247 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 281 transitions. Word has length 37 [2018-12-08 18:59:07,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,247 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 281 transitions. [2018-12-08 18:59:07,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:59:07,247 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 281 transitions. [2018-12-08 18:59:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-08 18:59:07,249 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,249 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,250 INFO L423 AbstractCegarLoop]: === Iteration 5 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,250 INFO L82 PathProgramCache]: Analyzing trace with hash 324263340, now seen corresponding path program 1 times [2018-12-08 18:59:07,250 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,251 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,293 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,294 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 18:59:07,294 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,294 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-08 18:59:07,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 18:59:07,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:59:07,295 INFO L87 Difference]: Start difference. First operand 211 states and 281 transitions. Second operand 4 states. [2018-12-08 18:59:07,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,367 INFO L93 Difference]: Finished difference Result 268 states and 349 transitions. [2018-12-08 18:59:07,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 18:59:07,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-12-08 18:59:07,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,369 INFO L225 Difference]: With dead ends: 268 [2018-12-08 18:59:07,369 INFO L226 Difference]: Without dead ends: 202 [2018-12-08 18:59:07,370 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 18:59:07,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-12-08 18:59:07,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 184. [2018-12-08 18:59:07,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-12-08 18:59:07,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 243 transitions. [2018-12-08 18:59:07,381 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 243 transitions. Word has length 45 [2018-12-08 18:59:07,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,382 INFO L480 AbstractCegarLoop]: Abstraction has 184 states and 243 transitions. [2018-12-08 18:59:07,382 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-08 18:59:07,382 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 243 transitions. [2018-12-08 18:59:07,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-12-08 18:59:07,384 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,384 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,384 INFO L423 AbstractCegarLoop]: === Iteration 6 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,384 INFO L82 PathProgramCache]: Analyzing trace with hash 726030577, now seen corresponding path program 1 times [2018-12-08 18:59:07,384 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,385 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,385 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,421 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:07,421 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,421 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:07,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:07,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,422 INFO L87 Difference]: Start difference. First operand 184 states and 243 transitions. Second operand 3 states. [2018-12-08 18:59:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,469 INFO L93 Difference]: Finished difference Result 243 states and 318 transitions. [2018-12-08 18:59:07,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:07,470 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2018-12-08 18:59:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,471 INFO L225 Difference]: With dead ends: 243 [2018-12-08 18:59:07,471 INFO L226 Difference]: Without dead ends: 182 [2018-12-08 18:59:07,472 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-12-08 18:59:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2018-12-08 18:59:07,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-12-08 18:59:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 239 transitions. [2018-12-08 18:59:07,483 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 239 transitions. Word has length 51 [2018-12-08 18:59:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,483 INFO L480 AbstractCegarLoop]: Abstraction has 182 states and 239 transitions. [2018-12-08 18:59:07,483 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:07,483 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 239 transitions. [2018-12-08 18:59:07,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-12-08 18:59:07,485 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,485 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,485 INFO L423 AbstractCegarLoop]: === Iteration 7 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,485 INFO L82 PathProgramCache]: Analyzing trace with hash 572107035, now seen corresponding path program 1 times [2018-12-08 18:59:07,485 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,486 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:07,517 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:07,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:07,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,518 INFO L87 Difference]: Start difference. First operand 182 states and 239 transitions. Second operand 3 states. [2018-12-08 18:59:07,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,536 INFO L93 Difference]: Finished difference Result 191 states and 250 transitions. [2018-12-08 18:59:07,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:07,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2018-12-08 18:59:07,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,537 INFO L225 Difference]: With dead ends: 191 [2018-12-08 18:59:07,537 INFO L226 Difference]: Without dead ends: 91 [2018-12-08 18:59:07,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-12-08 18:59:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-12-08 18:59:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-08 18:59:07,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 102 transitions. [2018-12-08 18:59:07,543 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 102 transitions. Word has length 50 [2018-12-08 18:59:07,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,543 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 102 transitions. [2018-12-08 18:59:07,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:07,543 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 102 transitions. [2018-12-08 18:59:07,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 18:59:07,544 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,544 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,544 INFO L423 AbstractCegarLoop]: === Iteration 8 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1516710605, now seen corresponding path program 1 times [2018-12-08 18:59:07,545 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,545 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,545 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,609 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,609 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:59:07,609 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 18:59:07,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 18:59:07,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:59:07,610 INFO L87 Difference]: Start difference. First operand 91 states and 102 transitions. Second operand 6 states. [2018-12-08 18:59:07,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,651 INFO L93 Difference]: Finished difference Result 142 states and 164 transitions. [2018-12-08 18:59:07,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:59:07,651 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-08 18:59:07,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,652 INFO L225 Difference]: With dead ends: 142 [2018-12-08 18:59:07,652 INFO L226 Difference]: Without dead ends: 101 [2018-12-08 18:59:07,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:59:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-12-08 18:59:07,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2018-12-08 18:59:07,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-12-08 18:59:07,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-12-08 18:59:07,658 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 59 [2018-12-08 18:59:07,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,659 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-12-08 18:59:07,659 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 18:59:07,659 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-12-08 18:59:07,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-12-08 18:59:07,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,660 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,660 INFO L423 AbstractCegarLoop]: === Iteration 9 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,660 INFO L82 PathProgramCache]: Analyzing trace with hash -367309916, now seen corresponding path program 1 times [2018-12-08 18:59:07,660 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,661 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,661 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,710 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:59:07,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 18:59:07,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 18:59:07,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:59:07,711 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 6 states. [2018-12-08 18:59:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,743 INFO L93 Difference]: Finished difference Result 107 states and 118 transitions. [2018-12-08 18:59:07,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:59:07,743 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2018-12-08 18:59:07,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,744 INFO L225 Difference]: With dead ends: 107 [2018-12-08 18:59:07,744 INFO L226 Difference]: Without dead ends: 100 [2018-12-08 18:59:07,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 18:59:07,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-12-08 18:59:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2018-12-08 18:59:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-12-08 18:59:07,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2018-12-08 18:59:07,749 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 59 [2018-12-08 18:59:07,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,750 INFO L480 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2018-12-08 18:59:07,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 18:59:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2018-12-08 18:59:07,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 18:59:07,751 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,751 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,751 INFO L423 AbstractCegarLoop]: === Iteration 10 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,751 INFO L82 PathProgramCache]: Analyzing trace with hash 857146700, now seen corresponding path program 1 times [2018-12-08 18:59:07,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,752 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,778 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:07,778 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,779 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:07,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:07,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,779 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 3 states. [2018-12-08 18:59:07,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,796 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2018-12-08 18:59:07,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:07,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-12-08 18:59:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,798 INFO L225 Difference]: With dead ends: 187 [2018-12-08 18:59:07,798 INFO L226 Difference]: Without dead ends: 180 [2018-12-08 18:59:07,798 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-12-08 18:59:07,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 168. [2018-12-08 18:59:07,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-12-08 18:59:07,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 188 transitions. [2018-12-08 18:59:07,810 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 188 transitions. Word has length 60 [2018-12-08 18:59:07,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,810 INFO L480 AbstractCegarLoop]: Abstraction has 168 states and 188 transitions. [2018-12-08 18:59:07,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:07,811 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 188 transitions. [2018-12-08 18:59:07,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-08 18:59:07,811 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,812 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,812 INFO L423 AbstractCegarLoop]: === Iteration 11 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1662813234, now seen corresponding path program 1 times [2018-12-08 18:59:07,812 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,813 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,876 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,876 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:59:07,877 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,877 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:59:07,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:59:07,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:59:07,877 INFO L87 Difference]: Start difference. First operand 168 states and 188 transitions. Second operand 5 states. [2018-12-08 18:59:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:07,954 INFO L93 Difference]: Finished difference Result 216 states and 246 transitions. [2018-12-08 18:59:07,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 18:59:07,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 60 [2018-12-08 18:59:07,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:07,955 INFO L225 Difference]: With dead ends: 216 [2018-12-08 18:59:07,956 INFO L226 Difference]: Without dead ends: 152 [2018-12-08 18:59:07,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:59:07,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-12-08 18:59:07,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2018-12-08 18:59:07,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-12-08 18:59:07,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 168 transitions. [2018-12-08 18:59:07,965 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 168 transitions. Word has length 60 [2018-12-08 18:59:07,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:07,966 INFO L480 AbstractCegarLoop]: Abstraction has 152 states and 168 transitions. [2018-12-08 18:59:07,966 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:59:07,966 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 168 transitions. [2018-12-08 18:59:07,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:59:07,967 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:07,967 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:07,967 INFO L423 AbstractCegarLoop]: === Iteration 12 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:07,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:07,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1935953947, now seen corresponding path program 1 times [2018-12-08 18:59:07,967 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:07,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,968 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:07,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:07,968 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:07,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:07,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:07,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:07,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:07,998 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:07,999 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:07,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:07,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:07,999 INFO L87 Difference]: Start difference. First operand 152 states and 168 transitions. Second operand 3 states. [2018-12-08 18:59:08,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,018 INFO L93 Difference]: Finished difference Result 212 states and 240 transitions. [2018-12-08 18:59:08,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:08,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-08 18:59:08,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,020 INFO L225 Difference]: With dead ends: 212 [2018-12-08 18:59:08,020 INFO L226 Difference]: Without dead ends: 164 [2018-12-08 18:59:08,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:08,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-12-08 18:59:08,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-12-08 18:59:08,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-12-08 18:59:08,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2018-12-08 18:59:08,031 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 62 [2018-12-08 18:59:08,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,032 INFO L480 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2018-12-08 18:59:08,032 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:08,032 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2018-12-08 18:59:08,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:59:08,032 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:08,033 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:08,033 INFO L423 AbstractCegarLoop]: === Iteration 13 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:08,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:08,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1349147933, now seen corresponding path program 1 times [2018-12-08 18:59:08,033 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:08,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,034 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:08,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:08,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:08,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:08,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 18:59:08,064 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:08,064 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 18:59:08,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 18:59:08,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:08,065 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand 3 states. [2018-12-08 18:59:08,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,094 INFO L93 Difference]: Finished difference Result 178 states and 197 transitions. [2018-12-08 18:59:08,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 18:59:08,095 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 62 [2018-12-08 18:59:08,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,095 INFO L225 Difference]: With dead ends: 178 [2018-12-08 18:59:08,095 INFO L226 Difference]: Without dead ends: 173 [2018-12-08 18:59:08,096 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 18:59:08,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-12-08 18:59:08,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 162. [2018-12-08 18:59:08,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-08 18:59:08,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 177 transitions. [2018-12-08 18:59:08,102 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 177 transitions. Word has length 62 [2018-12-08 18:59:08,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,102 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 177 transitions. [2018-12-08 18:59:08,102 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 18:59:08,102 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 177 transitions. [2018-12-08 18:59:08,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-12-08 18:59:08,103 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:08,103 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:08,103 INFO L423 AbstractCegarLoop]: === Iteration 14 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:08,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:08,104 INFO L82 PathProgramCache]: Analyzing trace with hash 475938380, now seen corresponding path program 1 times [2018-12-08 18:59:08,104 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:08,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:08,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,104 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:08,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:08,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:08,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:08,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 18:59:08,156 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:08,157 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 18:59:08,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 18:59:08,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:59:08,157 INFO L87 Difference]: Start difference. First operand 162 states and 177 transitions. Second operand 7 states. [2018-12-08 18:59:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,193 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2018-12-08 18:59:08,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:59:08,193 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 62 [2018-12-08 18:59:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,194 INFO L225 Difference]: With dead ends: 184 [2018-12-08 18:59:08,194 INFO L226 Difference]: Without dead ends: 162 [2018-12-08 18:59:08,194 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-12-08 18:59:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-12-08 18:59:08,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2018-12-08 18:59:08,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-12-08 18:59:08,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 173 transitions. [2018-12-08 18:59:08,200 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 173 transitions. Word has length 62 [2018-12-08 18:59:08,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,201 INFO L480 AbstractCegarLoop]: Abstraction has 162 states and 173 transitions. [2018-12-08 18:59:08,201 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 18:59:08,201 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 173 transitions. [2018-12-08 18:59:08,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:59:08,201 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:08,201 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:08,202 INFO L423 AbstractCegarLoop]: === Iteration 15 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:08,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:08,202 INFO L82 PathProgramCache]: Analyzing trace with hash -1363732376, now seen corresponding path program 1 times [2018-12-08 18:59:08,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,202 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:08,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,202 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:08,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:08,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:08,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:08,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-12-08 18:59:08,246 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:08,246 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-08 18:59:08,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 18:59:08,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:59:08,246 INFO L87 Difference]: Start difference. First operand 162 states and 173 transitions. Second operand 7 states. [2018-12-08 18:59:08,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,332 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2018-12-08 18:59:08,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-08 18:59:08,332 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 63 [2018-12-08 18:59:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,333 INFO L225 Difference]: With dead ends: 176 [2018-12-08 18:59:08,333 INFO L226 Difference]: Without dead ends: 151 [2018-12-08 18:59:08,333 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-08 18:59:08,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-12-08 18:59:08,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 140. [2018-12-08 18:59:08,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-12-08 18:59:08,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2018-12-08 18:59:08,338 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 63 [2018-12-08 18:59:08,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,339 INFO L480 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2018-12-08 18:59:08,339 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-08 18:59:08,339 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2018-12-08 18:59:08,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:59:08,339 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:08,339 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:08,339 INFO L423 AbstractCegarLoop]: === Iteration 16 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:08,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:08,339 INFO L82 PathProgramCache]: Analyzing trace with hash 359859562, now seen corresponding path program 1 times [2018-12-08 18:59:08,340 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,340 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:08,340 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,340 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:08,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:08,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 18:59:08,397 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:08,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 18:59:08,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 18:59:08,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 18:59:08,398 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand 5 states. [2018-12-08 18:59:08,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,457 INFO L93 Difference]: Finished difference Result 165 states and 176 transitions. [2018-12-08 18:59:08,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:59:08,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 63 [2018-12-08 18:59:08,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,458 INFO L225 Difference]: With dead ends: 165 [2018-12-08 18:59:08,458 INFO L226 Difference]: Without dead ends: 133 [2018-12-08 18:59:08,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-12-08 18:59:08,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-08 18:59:08,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-08 18:59:08,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-08 18:59:08,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 138 transitions. [2018-12-08 18:59:08,464 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 138 transitions. Word has length 63 [2018-12-08 18:59:08,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,464 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 138 transitions. [2018-12-08 18:59:08,464 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 18:59:08,465 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 138 transitions. [2018-12-08 18:59:08,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-12-08 18:59:08,465 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:08,465 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:08,465 INFO L423 AbstractCegarLoop]: === Iteration 17 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:08,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:08,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1291919834, now seen corresponding path program 1 times [2018-12-08 18:59:08,466 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:08,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,467 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:08,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:08,502 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:08,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:59:08,502 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:08,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 18:59:08,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 18:59:08,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:59:08,503 INFO L87 Difference]: Start difference. First operand 133 states and 138 transitions. Second operand 6 states. [2018-12-08 18:59:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,531 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2018-12-08 18:59:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 18:59:08,531 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-12-08 18:59:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,531 INFO L225 Difference]: With dead ends: 144 [2018-12-08 18:59:08,532 INFO L226 Difference]: Without dead ends: 133 [2018-12-08 18:59:08,532 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:59:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-12-08 18:59:08,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-12-08 18:59:08,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-08 18:59:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 136 transitions. [2018-12-08 18:59:08,537 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 136 transitions. Word has length 63 [2018-12-08 18:59:08,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,537 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 136 transitions. [2018-12-08 18:59:08,537 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 18:59:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 136 transitions. [2018-12-08 18:59:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-08 18:59:08,537 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 18:59:08,538 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 18:59:08,538 INFO L423 AbstractCegarLoop]: === Iteration 18 === [errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 18:59:08,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 18:59:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 1154361885, now seen corresponding path program 1 times [2018-12-08 18:59:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 18:59:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 18:59:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 18:59:08,539 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 18:59:08,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 18:59:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 18:59:08,576 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 18:59:08,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-08 18:59:08,577 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 18:59:08,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-08 18:59:08,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 18:59:08,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-08 18:59:08,577 INFO L87 Difference]: Start difference. First operand 133 states and 136 transitions. Second operand 6 states. [2018-12-08 18:59:08,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 18:59:08,634 INFO L93 Difference]: Finished difference Result 133 states and 136 transitions. [2018-12-08 18:59:08,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 18:59:08,635 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2018-12-08 18:59:08,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 18:59:08,635 INFO L225 Difference]: With dead ends: 133 [2018-12-08 18:59:08,635 INFO L226 Difference]: Without dead ends: 0 [2018-12-08 18:59:08,636 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 18:59:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-08 18:59:08,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-08 18:59:08,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-08 18:59:08,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-08 18:59:08,636 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 74 [2018-12-08 18:59:08,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 18:59:08,636 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 18:59:08,636 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-08 18:59:08,637 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-08 18:59:08,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-08 18:59:08,640 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-08 18:59:09,699 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 60 [2018-12-08 18:59:11,039 INFO L451 ceAbstractionStarter]: At program point KeSetEventENTRY(lines 514 521) the Hoare annotation is: true [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point KeSetEventFINAL(lines 514 521) no Hoare annotation was computed. [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point KeSetEventEXIT(lines 514 521) no Hoare annotation was computed. [2018-12-08 18:59:11,039 INFO L451 ceAbstractionStarter]: At program point KbFilter_CompleteENTRY(lines 564 574) the Hoare annotation is: true [2018-12-08 18:59:11,039 INFO L451 ceAbstractionStarter]: At program point L570(line 570) the Hoare annotation is: true [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point L570-1(line 570) no Hoare annotation was computed. [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point KbFilter_CompleteFINAL(lines 564 574) no Hoare annotation was computed. [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point KbFilter_CompleteEXIT(lines 564 574) no Hoare annotation was computed. [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point stub_driver_initEXIT(lines 36 49) no Hoare annotation was computed. [2018-12-08 18:59:11,039 INFO L444 ceAbstractionStarter]: At program point stub_driver_initENTRY(lines 36 49) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 |old(~pended~0)|) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1) (and (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0))) [2018-12-08 18:59:11,039 INFO L448 ceAbstractionStarter]: For program point stub_driver_initFINAL(lines 36 49) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point _BLAST_initFINAL(lines 50 71) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L444 ceAbstractionStarter]: At program point _BLAST_initENTRY(lines 50 71) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (and (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point _BLAST_initEXIT(lines 50 71) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L451 ceAbstractionStarter]: At program point errorFnENTRY(lines 576 583) the Hoare annotation is: true [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point errorFnFINAL(lines 576 583) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point errorFnEXIT(lines 576 583) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point errorFnErr0ASSERT_VIOLATIONERROR_FUNCTION(line 580) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 287 421) no Hoare annotation was computed. [2018-12-08 18:59:11,040 INFO L444 ceAbstractionStarter]: At program point L399(line 399) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,040 INFO L448 ceAbstractionStarter]: For program point L358(line 358) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L444 ceAbstractionStarter]: At program point L383(lines 376 416) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 410) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L444 ceAbstractionStarter]: At program point L375(lines 368 417) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point L384(lines 368 417) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 366) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 287 421) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point $Ultimate##14(lines 355 365) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point $Ultimate##13(lines 355 365) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L448 ceAbstractionStarter]: For program point L385(lines 385 414) no Hoare annotation was computed. [2018-12-08 18:59:11,041 INFO L444 ceAbstractionStarter]: At program point L352(lines 351 366) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (= ~NP~0 ~s~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= ~compRegistered~0 0)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,041 INFO L444 ceAbstractionStarter]: At program point mainENTRY(lines 287 421) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (and (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L377(lines 377 381) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L369(lines 369 373) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L336(lines 322 367) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L386(lines 386 413) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L444 ceAbstractionStarter]: At program point L320(line 320) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (and (<= 0 ~compRegistered~0) (<= ~MPR3~0 0) (= ~MPR1~0 ~s~0) (<= 0 main_~status~1) (= ~s~0 ~MPR3~0) (= ~NP~0 ~s~0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L320-1(lines 296 420) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 411) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L444 ceAbstractionStarter]: At program point L395(lines 386 413) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L387(lines 387 393) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L444 ceAbstractionStarter]: At program point L354(lines 353 366) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (<= 0 main_~status~1) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L404(lines 404 406) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 390) no Hoare annotation was computed. [2018-12-08 18:59:11,042 INFO L444 ceAbstractionStarter]: At program point L322(lines 296 420) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (and (not (= ~pended~0 1)) (and (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0))) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L339-1(lines 338 348) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L397(lines 397 401) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L331(lines 331 334) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L444 ceAbstractionStarter]: At program point L331-2(lines 331 334) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (not (= |old(~s~0)| |old(~NP~0)|)) (= 1 |old(~pended~0)|) (not (= |old(~SKIP1~0)| |old(~s~0)|)) (< 0 |old(~MPR3~0)|) (not (= |old(~s~0)| |old(~MPR1~0)|)) (not (= |old(~s~0)| |old(~MPR3~0)|)) (and (<= 0 ~compRegistered~0) (<= 1 ~s~0) (<= (+ ~NP~0 4) ~MPR1~0) (<= (+ ~NP~0 5) ~MPR3~0) (<= 0 main_~status~1) (= ~NP~0 ~s~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (<= ~s~0 1) (not (= ~pended~0 1)) (<= ~compRegistered~0 0)) (< |old(~MPR3~0)| 0) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L444(lines 444 447) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L444-1(lines 444 447) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point $Ultimate##8(lines 459 471) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point $Ultimate##9(lines 459 471) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L478(lines 478 495) no Hoare annotation was computed. [2018-12-08 18:59:11,043 INFO L444 ceAbstractionStarter]: At program point L445(line 445) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (= ~NP~0 ~s~0) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-12-08 18:59:11,043 INFO L448 ceAbstractionStarter]: For program point L445-1(line 445) no Hoare annotation was computed. [2018-12-08 18:59:11,044 INFO L444 ceAbstractionStarter]: At program point L470(lines 443 498) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (let ((.cse3 (= ~MPR1~0 ~s~0))) (or (< ~MPR3~0 (+ ~NP~0 5)) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (and .cse3 (= 0 IofCallDriver_~returnVal2~0)) (< 1 ~NP~0) .cse2 (and .cse3 (<= (+ IofCallDriver_~returnVal2~0 1073741823) 0)) (not (= |old(~s~0)| ~NP~0)) (< ~compRegistered~0 1) (< |old(~s~0)| 1) (and .cse3 (= IofCallDriver_~returnVal2~0 259) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)))))) [2018-12-08 18:59:11,044 INFO L444 ceAbstractionStarter]: At program point IofCallDriverENTRY(lines 436 499) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (= ~NP~0 ~s~0) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-12-08 18:59:11,044 INFO L444 ceAbstractionStarter]: At program point L458(lines 457 472) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (and (= ~MPR1~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-12-08 18:59:11,044 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 494) no Hoare annotation was computed. [2018-12-08 18:59:11,044 INFO L448 ceAbstractionStarter]: For program point L450(lines 450 473) no Hoare annotation was computed. [2018-12-08 18:59:11,044 INFO L448 ceAbstractionStarter]: For program point IofCallDriverFINAL(lines 436 499) no Hoare annotation was computed. [2018-12-08 18:59:11,044 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 485) no Hoare annotation was computed. [2018-12-08 18:59:11,044 INFO L444 ceAbstractionStarter]: At program point L446(line 446) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (and (= ~NP~0 ~s~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)) (or (< ~compRegistered~0 0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)))) [2018-12-08 18:59:11,044 INFO L448 ceAbstractionStarter]: For program point IofCallDriverEXIT(lines 436 499) no Hoare annotation was computed. [2018-12-08 18:59:11,044 INFO L444 ceAbstractionStarter]: At program point L492(line 492) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)))) [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point L492-1(lines 474 496) no Hoare annotation was computed. [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point L455(lines 455 472) no Hoare annotation was computed. [2018-12-08 18:59:11,045 INFO L444 ceAbstractionStarter]: At program point L451(lines 450 473) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (= ~MPR1~0 ~s~0) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)))) [2018-12-08 18:59:11,045 INFO L444 ceAbstractionStarter]: At program point L456(lines 455 472) the Hoare annotation is: (let ((.cse0 (< 3 ~SKIP1~0)) (.cse1 (= 1 ~pended~0)) (.cse2 (< ~SKIP1~0 3))) (and (or (< ~compRegistered~0 0) (= ~SKIP1~0 ~s~0) .cse0 .cse1 (not (= ~SKIP1~0 |old(~s~0)|)) .cse2 (< 0 ~compRegistered~0)) (or (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) .cse0 .cse1 (= ~MPR1~0 ~s~0) (< ~MPR1~0 (+ ~NP~0 4)) (< ~compRegistered~0 1) (< 1 ~NP~0) .cse2 (< |old(~s~0)| 1)))) [2018-12-08 18:59:11,045 INFO L444 ceAbstractionStarter]: At program point L430(line 430) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (not (= |old(~s~0)| ~NP~0)) (< ~setEventCalled~0 1) (< ~compRegistered~0 1) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point L430-1(lines 422 435) no Hoare annotation was computed. [2018-12-08 18:59:11,045 INFO L444 ceAbstractionStarter]: At program point stubMoreProcessingRequiredENTRY(lines 422 435) the Hoare annotation is: (or (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (= ~NP~0 ~s~0) (< 1 ~NP~0) (< ~SKIP1~0 3) (not (= |old(~s~0)| ~NP~0)) (< ~setEventCalled~0 1) (< ~compRegistered~0 1) (< |old(~s~0)| 1) (< 1 ~setEventCalled~0)) [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point stubMoreProcessingRequiredEXIT(lines 422 435) no Hoare annotation was computed. [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-08 18:59:11,045 INFO L444 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (= ~s~0 |old(~s~0)|) [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-08 18:59:11,045 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectEXIT(lines 522 563) no Hoare annotation was computed. [2018-12-08 18:59:11,046 INFO L444 ceAbstractionStarter]: At program point L535(lines 527 546) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1)) (.cse4 (< ~SKIP1~0 3))) (and (or .cse0 (= ~s~0 ~NP~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) .cse4 (< 1 |old(~setEventCalled~0)|)))) [2018-12-08 18:59:11,046 INFO L448 ceAbstractionStarter]: For program point L527(lines 527 546) no Hoare annotation was computed. [2018-12-08 18:59:11,046 INFO L448 ceAbstractionStarter]: For program point $Ultimate##16(lines 553 560) no Hoare annotation was computed. [2018-12-08 18:59:11,046 INFO L448 ceAbstractionStarter]: For program point $Ultimate##15(lines 553 560) no Hoare annotation was computed. [2018-12-08 18:59:11,046 INFO L444 ceAbstractionStarter]: At program point L552(lines 551 561) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1)) (.cse4 (< ~SKIP1~0 3)) (.cse6 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (not (= ~pended~0 1))))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) .cse4 .cse6 (< 1 |old(~setEventCalled~0)|)))) [2018-12-08 18:59:11,046 INFO L444 ceAbstractionStarter]: At program point L550(lines 549 561) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse3 (< ~compRegistered~0 1)) (.cse4 (< ~SKIP1~0 3)) (.cse6 (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0) (<= ~SKIP1~0 3) (<= 3 ~SKIP1~0) (not (= ~pended~0 1))))) (and (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse3 .cse4) .cse5 .cse6) (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse5 (not (= |old(~s~0)| ~MPR3~0)) .cse3 (< 1 ~NP~0) .cse4 .cse6 (< 1 |old(~setEventCalled~0)|)))) [2018-12-08 18:59:11,046 INFO L444 ceAbstractionStarter]: At program point L542(line 542) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse4 (< ~compRegistered~0 1)) (.cse5 (< ~SKIP1~0 3)) (.cse3 (< ~MPR1~0 (+ ~NP~0 4)))) (and (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) .cse4 (< 1 ~NP~0) .cse5 (< 1 |old(~setEventCalled~0)|)) (or .cse0 (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse5) .cse3))) [2018-12-08 18:59:11,046 INFO L448 ceAbstractionStarter]: For program point KeWaitForSingleObjectFINAL(lines 522 563) no Hoare annotation was computed. [2018-12-08 18:59:11,046 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 544) no Hoare annotation was computed. [2018-12-08 18:59:11,046 INFO L448 ceAbstractionStarter]: For program point L540-1(lines 527 546) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point L528(lines 528 533) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L444 ceAbstractionStarter]: At program point KeWaitForSingleObjectENTRY(lines 522 563) the Hoare annotation is: (let ((.cse0 (< ~MPR3~0 (+ ~NP~0 5))) (.cse1 (< 3 ~SKIP1~0)) (.cse2 (= 1 ~pended~0)) (.cse4 (< ~compRegistered~0 1)) (.cse5 (< ~SKIP1~0 3)) (.cse3 (< ~MPR1~0 (+ ~NP~0 4)))) (and (or .cse0 (< |old(~setEventCalled~0)| 1) (< ~NP~0 1) .cse1 .cse2 .cse3 (not (= |old(~s~0)| ~MPR3~0)) (and (= ~s~0 |old(~s~0)|) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse4 (< 1 ~NP~0) .cse5 (< 1 |old(~setEventCalled~0)|)) (or .cse0 (= ~NP~0 ~s~0) (or (not (= |old(~s~0)| ~NP~0)) .cse1 .cse2 .cse4 .cse5) .cse3))) [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point L549(lines 549 561) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L444 ceAbstractionStarter]: At program point L508(line 508) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP1~0 3)) [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point L508-1(lines 500 513) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L444 ceAbstractionStarter]: At program point IofCompleteRequestENTRY(lines 500 513) the Hoare annotation is: (or (not (= |old(~s~0)| ~NP~0)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~compRegistered~0 1) (< ~SKIP1~0 3) (= ~s~0 ~NP~0)) [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 510) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point IofCompleteRequestEXIT(lines 500 513) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-08 18:59:11,047 INFO L444 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= ~MPR1~0 ~s~0) (= ~s~0 ~MPR3~0) (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (<= ~MPR3~0 0) (<= 0 ~MPR3~0) (not (= ~pended~0 1)) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) [2018-12-08 18:59:11,047 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-08 18:59:11,047 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L444 ceAbstractionStarter]: At program point L225(lines 225 226) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L225-1(lines 225 226) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L444 ceAbstractionStarter]: At program point L250(line 250) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L250-1(lines 246 252) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L143(lines 143 269) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L110(lines 110 280) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L444 ceAbstractionStarter]: At program point L102(lines 101 283) the Hoare annotation is: (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (= 1 ~pended~0)) (.cse4 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (< 0 |old(~compRegistered~0)|)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< |old(~s~0)| 1))) (and (or (and (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (<= 0 KbFilter_PnP_~status~0) (<= ~compRegistered~0 0)) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9))) [2018-12-08 18:59:11,048 INFO L444 ceAbstractionStarter]: At program point L193(lines 193 195) the Hoare annotation is: (let ((.cse11 (<= 1 ~compRegistered~0)) (.cse12 (+ ~NP~0 5))) (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 .cse12)) (.cse2 (and (<= .cse12 ~MPR3~0) (= ~NP~0 ~s~0) .cse11)) (.cse3 (< 3 ~SKIP1~0)) (.cse4 (= 1 ~pended~0)) (.cse5 (< ~MPR1~0 (+ ~NP~0 4))) (.cse6 (< 1 ~NP~0)) (.cse7 (< ~SKIP1~0 3)) (.cse8 (< 0 |old(~compRegistered~0)|)) (.cse9 (not (= |old(~s~0)| ~NP~0))) (.cse10 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (<= (+ ~myStatus~0 1073741637) 0) .cse10) (or .cse0 .cse1 .cse2 .cse3 (and (<= 259 KbFilter_PnP_~__cil_tmp23~0) .cse11 (<= KbFilter_PnP_~__cil_tmp23~0 259) (<= 259 KbFilter_PnP_~status~0) (= ~s~0 ~MPR3~0) (<= 1 ~setEventCalled~0) (<= ~setEventCalled~0 1)) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L193-1(lines 193 195) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L152(lines 152 266) no Hoare annotation was computed. [2018-12-08 18:59:11,048 INFO L448 ceAbstractionStarter]: For program point L119(lines 119 277) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L444 ceAbstractionStarter]: At program point L210(line 210) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (and (= ~s~0 ~NP~0) (<= 1 ~compRegistered~0)) (< 0 |old(~compRegistered~0)|) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,049 INFO L444 ceAbstractionStarter]: At program point L177(line 177) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,049 INFO L444 ceAbstractionStarter]: At program point L235(line 235) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L235-1(lines 231 237) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L161(lines 161 263) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L128(lines 128 274) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L444 ceAbstractionStarter]: At program point L219(line 219) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,049 INFO L444 ceAbstractionStarter]: At program point L186(lines 186 187) the Hoare annotation is: (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (= 1 ~pended~0)) (.cse4 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (< 0 |old(~compRegistered~0)|)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (and (<= 1 ~compRegistered~0) (= ~NP~0 ~s~0) (<= 0 KbFilter_PnP_~status~0)) .cse8 .cse9) (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= (+ ~myStatus~0 1073741637) 0) .cse8 .cse9))) [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L219-1(lines 215 221) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 186 187) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point KbFilter_PnPEXIT(lines 74 286) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L170(lines 170 182) no Hoare annotation was computed. [2018-12-08 18:59:11,049 INFO L448 ceAbstractionStarter]: For program point L137(lines 137 271) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L104(lines 104 282) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L451 ceAbstractionStarter]: At program point L261(lines 165 262) the Hoare annotation is: true [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L146(lines 146 268) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L113(lines 113 279) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L444 ceAbstractionStarter]: At program point KbFilter_PnPENTRY(lines 74 286) the Hoare annotation is: (let ((.cse0 (< |old(~compRegistered~0)| 0)) (.cse1 (< ~MPR3~0 (+ ~NP~0 5))) (.cse2 (< 3 ~SKIP1~0)) (.cse3 (= 1 ~pended~0)) (.cse4 (< ~MPR1~0 (+ ~NP~0 4))) (.cse5 (< 1 ~NP~0)) (.cse6 (< ~SKIP1~0 3)) (.cse7 (< 0 |old(~compRegistered~0)|)) (.cse8 (not (= |old(~s~0)| ~NP~0))) (.cse9 (< |old(~s~0)| 1))) (and (or .cse0 .cse1 (< 0 (+ |old(~myStatus~0)| 1073741637)) .cse2 .cse3 .cse4 (<= (+ ~myStatus~0 1073741637) 0) .cse5 .cse6 .cse7 .cse8 .cse9) (or .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (and (<= 0 ~compRegistered~0) (= ~NP~0 ~s~0) (<= ~compRegistered~0 0))))) [2018-12-08 18:59:11,050 INFO L444 ceAbstractionStarter]: At program point L105(lines 104 282) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point KbFilter_PnPFINAL(lines 74 286) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L155(lines 155 265) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L122(lines 122 276) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L444 ceAbstractionStarter]: At program point L172(line 172) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< ~NP~0 1) (< 1 |old(~s~0)|) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< |old(~s~0)| 1) (< 0 |old(~compRegistered~0)|)) [2018-12-08 18:59:11,050 INFO L444 ceAbstractionStarter]: At program point L164(lines 110 280) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L131(lines 131 273) no Hoare annotation was computed. [2018-12-08 18:59:11,050 INFO L448 ceAbstractionStarter]: For program point L140(lines 140 270) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L107(lines 107 281) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 237) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L444 ceAbstractionStarter]: At program point L256(lines 256 257) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L256-1(lines 256 257) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 221) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L149(lines 149 267) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L116(lines 116 278) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L444 ceAbstractionStarter]: At program point L108(lines 107 281) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (= ~s~0 ~NP~0) (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L199(lines 199 205) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L191(lines 191 197) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L158(lines 158 264) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L125(lines 125 275) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L448 ceAbstractionStarter]: For program point L191-2(lines 165 260) no Hoare annotation was computed. [2018-12-08 18:59:11,051 INFO L444 ceAbstractionStarter]: At program point L241(line 241) the Hoare annotation is: (or (< |old(~compRegistered~0)| 0) (< ~MPR3~0 (+ ~NP~0 5)) (< 3 ~SKIP1~0) (= 1 ~pended~0) (< ~MPR1~0 (+ ~NP~0 4)) (< 1 ~NP~0) (< ~SKIP1~0 3) (< 0 |old(~compRegistered~0)|) (and (<= 0 ~compRegistered~0) (<= ~compRegistered~0 0) (= ~SKIP1~0 ~s~0)) (not (= |old(~s~0)| ~NP~0)) (< |old(~s~0)| 1)) [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point L241-1(line 241) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point L175(lines 175 181) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point L175-1(lines 170 182) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point $Ultimate##43(lines 165 262) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point L200(lines 200 204) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point L134(lines 134 272) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point L101(lines 101 283) no Hoare annotation was computed. [2018-12-08 18:59:11,052 INFO L448 ceAbstractionStarter]: For program point $Ultimate##44(lines 165 262) no Hoare annotation was computed. [2018-12-08 18:59:11,075 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.12 06:59:11 BoogieIcfgContainer [2018-12-08 18:59:11,075 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-08 18:59:11,076 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 18:59:11,076 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 18:59:11,076 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 18:59:11,076 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 06:59:06" (3/4) ... [2018-12-08 18:59:11,079 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeSetEvent [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_Complete [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stub_driver_init [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure _BLAST_init [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure errorFn [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCallDriver [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure stubMoreProcessingRequired [2018-12-08 18:59:11,085 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-08 18:59:11,086 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KeWaitForSingleObject [2018-12-08 18:59:11,086 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure IofCompleteRequest [2018-12-08 18:59:11,086 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure KbFilter_PnP [2018-12-08 18:59:11,094 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 27 nodes and edges [2018-12-08 18:59:11,094 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2018-12-08 18:59:11,095 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-08 18:59:11,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-12-08 18:59:11,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-12-08 18:59:11,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-12-08 18:59:11,113 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-12-08 18:59:11,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) [2018-12-08 18:59:11,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) [2018-12-08 18:59:11,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) [2018-12-08 18:59:11,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || ((((((((((0 <= compRegistered && 1 <= s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && 0 <= status) && NP == s) && SKIP1 <= 3) && 3 <= SKIP1) && s <= 1) && !(pended == 1)) && compRegistered <= 0)) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-12-08 18:59:11,114 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 0 <= status) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) [2018-12-08 18:59:11,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && (((((((((((MPR3 < NP + 5 || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || (MPR1 == s && 0 == returnVal2)) || 1 < NP) || SKIP1 < 3) || (MPR1 == s && returnVal2 + 1073741823 <= 0)) || !(\old(s) == NP)) || compRegistered < 1) || \old(s) < 1) || (((MPR1 == s && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) [2018-12-08 18:59:11,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((MPR3 < NP + 5 || s == NP) || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) && ((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || 1 < \old(setEventCalled)) [2018-12-08 18:59:11,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) [2018-12-08 18:59:11,115 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((MPR3 < NP + 5 || ((MPR1 == s && 1 <= setEventCalled) && setEventCalled <= 1)) || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) && ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) [2018-12-08 18:59:11,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((0 <= compRegistered && NP == s) && 0 <= status) && compRegistered <= 0) || \old(compRegistered) < 0) || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) && (((((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || myStatus + 1073741637 <= 0) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) [2018-12-08 18:59:11,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 [2018-12-08 18:59:11,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 [2018-12-08 18:59:11,116 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 [2018-12-08 18:59:11,150 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_2a63d13f-2001-47fe-81f8-eedf05abbe20/bin-2019/utaipan/witness.graphml [2018-12-08 18:59:11,150 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 18:59:11,151 INFO L168 Benchmark]: Toolchain (without parser) took 5234.46 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 333.4 MB). Free memory was 952.4 MB in the beginning and 1.1 GB in the end (delta: -111.6 MB). Peak memory consumption was 221.8 MB. Max. memory is 11.5 GB. [2018-12-08 18:59:11,151 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:59:11,152 INFO L168 Benchmark]: CACSL2BoogieTranslator took 175.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-08 18:59:11,152 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. [2018-12-08 18:59:11,152 INFO L168 Benchmark]: Boogie Preprocessor took 22.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 18:59:11,152 INFO L168 Benchmark]: RCFGBuilder took 315.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. [2018-12-08 18:59:11,152 INFO L168 Benchmark]: TraceAbstraction took 4599.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 425.6 MB. Max. memory is 11.5 GB. [2018-12-08 18:59:11,153 INFO L168 Benchmark]: Witness Printer took 74.67 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-08 18:59:11,154 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 175.63 ms. Allocated memory is still 1.0 GB. Free memory was 952.4 MB in the beginning and 936.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 44.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 936.3 MB in the beginning and 1.1 GB in the end (delta: -210.8 MB). Peak memory consumption was 13.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 315.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 43.9 MB). Peak memory consumption was 43.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4599.07 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 178.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 20.6 MB). Peak memory consumption was 425.6 MB. Max. memory is 11.5 GB. * Witness Printer took 74.67 ms. Allocated memory is still 1.4 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.5 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 580]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 386]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 296]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 0 <= status) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 - InvariantResult [Line: 443]: Loop Invariant Derived loop invariant: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && (((((((((((MPR3 < NP + 5 || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || (MPR1 == s && 0 == returnVal2)) || 1 < NP) || SKIP1 < 3) || (MPR1 == s && returnVal2 + 1073741823 <= 0)) || !(\old(s) == NP)) || compRegistered < 1) || \old(s) < 1) || (((MPR1 == s && returnVal2 == 259) && 1 <= setEventCalled) && setEventCalled <= 1)) - InvariantResult [Line: 527]: Loop Invariant Derived loop invariant: (((MPR3 < NP + 5 || s == NP) || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) && ((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || 1 < \old(setEventCalled)) - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 - InvariantResult [Line: 450]: Loop Invariant Derived loop invariant: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) - InvariantResult [Line: 165]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 457]: Loop Invariant Derived loop invariant: ((((((((((MPR3 < NP + 5 || ((MPR1 == s && 1 <= setEventCalled) && setEventCalled <= 1)) || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) && ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) - InvariantResult [Line: 101]: Loop Invariant Derived loop invariant: (((((((((((((0 <= compRegistered && NP == s) && 0 <= status) && compRegistered <= 0) || \old(compRegistered) < 0) || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) && (((((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 0 < \old(myStatus) + 1073741637) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || myStatus + 1073741637 <= 0) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || !(\old(s) == NP)) || \old(s) < 1) - InvariantResult [Line: 551]: Loop Invariant Derived loop invariant: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) - InvariantResult [Line: 376]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || (!(pended == 1) && SKIP1 <= 3 && 3 <= SKIP1)) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || \old(MPR3) < 0) || 0 < \old(compRegistered) - InvariantResult [Line: 104]: Loop Invariant Derived loop invariant: (((((((((\old(compRegistered) < 0 || MPR3 < NP + 5) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || 1 < NP) || SKIP1 < 3) || 0 < \old(compRegistered)) || ((s == NP && 0 <= compRegistered) && compRegistered <= 0)) || !(\old(s) == NP)) || \old(s) < 1 - InvariantResult [Line: 549]: Loop Invariant Derived loop invariant: (((MPR3 < NP + 5 || (((!(\old(s) == NP) || 3 < SKIP1) || 1 == pended) || compRegistered < 1) || SKIP1 < 3) || MPR1 < NP + 4) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) && (((((((((((MPR3 < NP + 5 || \old(setEventCalled) < 1) || NP < 1) || 3 < SKIP1) || 1 == pended) || MPR1 < NP + 4) || !(\old(s) == MPR3)) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || ((((s == NP && 1 <= compRegistered) && SKIP1 <= 3) && 3 <= SKIP1) && !(pended == 1))) || 1 < \old(setEventCalled)) - InvariantResult [Line: 455]: Loop Invariant Derived loop invariant: ((((((compRegistered < 0 || SKIP1 == s) || 3 < SKIP1) || 1 == pended) || !(SKIP1 == \old(s))) || SKIP1 < 3) || 0 < compRegistered) && ((((((((((MPR3 < NP + 5 || NP < 1) || 1 < \old(s)) || 3 < SKIP1) || 1 == pended) || MPR1 == s) || MPR1 < NP + 4) || compRegistered < 1) || 1 < NP) || SKIP1 < 3) || \old(s) < 1) - InvariantResult [Line: 351]: Loop Invariant Derived loop invariant: ((((((((\old(compRegistered) < 0 || !(\old(s) == \old(NP))) || 1 == \old(pended)) || !(\old(SKIP1) == \old(s))) || 0 < \old(MPR3)) || !(\old(s) == \old(MPR1))) || !(\old(s) == \old(MPR3))) || ((((((((((0 <= compRegistered && 1 <= s) && NP + 4 <= MPR1) && NP + 5 <= MPR3) && 0 <= status) && NP == s) && SKIP1 <= 3) && 3 <= SKIP1) && s <= 1) && !(pended == 1)) && compRegistered <= 0)) || \old(MPR3) < 0) || 0 < \old(compRegistered) - StatisticsResult: Ultimate Automizer benchmark data CFG has 13 procedures, 159 locations, 1 error locations. SAFE Result, 4.5s OverallTime, 18 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 2.3s HoareAnnotationTime, HoareTripleCheckerStatistics: 2243 SDtfs, 1294 SDslu, 2856 SDs, 0 SdLazy, 602 SolverSat, 185 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 124 GetRequests, 53 SyntacticMatches, 10 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 114 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 53 LocationsWithAnnotation, 309 PreInvPairs, 382 NumberOfFragments, 3065 HoareAnnotationTreeSize, 309 FomulaSimplifications, 319 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 53 FomulaSimplificationsInter, 4642 FormulaSimplificationTreeSizeReductionInter, 2.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 943 NumberOfCodeBlocks, 943 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 925 ConstructedInterpolants, 0 QuantifiedInterpolants, 91783 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...