./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/config/TaipanReach.xml -i ../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:25:36,220 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:25:36,223 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:25:36,283 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:25:36,283 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:25:36,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:25:36,290 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:25:36,294 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:25:36,297 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:25:36,306 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:25:36,307 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:25:36,309 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:25:36,310 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:25:36,311 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:25:36,313 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:25:36,315 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:25:36,316 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:25:36,317 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:25:36,320 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:25:36,322 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:25:36,324 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:25:36,326 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:25:36,328 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:25:36,329 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:25:36,333 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:25:36,334 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:25:36,334 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:25:36,335 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:25:36,336 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:25:36,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:25:36,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:25:36,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:25:36,340 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:25:36,342 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:25:36,343 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:25:36,344 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:25:36,345 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:25:36,345 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:25:36,345 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:25:36,346 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:25:36,347 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:25:36,348 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-29 05:25:36,397 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:25:36,405 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:25:36,407 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:25:36,407 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:25:36,407 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:25:36,408 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:25:36,408 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:25:36,408 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:25:36,409 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:25:36,409 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:25:36,410 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:25:36,410 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:25:36,411 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:25:36,411 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:25:36,411 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:25:36,412 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:25:36,412 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:25:36,413 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:25:36,413 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:25:36,413 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:25:36,414 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-29 05:25:36,414 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:25:36,414 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-29 05:25:36,414 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:25:36,415 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:25:36,415 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-29 05:25:36,415 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:25:36,416 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-29 05:25:36,416 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:25:36,416 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:25:36,416 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:25:36,417 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:25:36,417 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:25:36,418 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-29 05:25:36,418 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:25:36,418 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:25:36,418 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-29 05:25:36,419 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:25:36,419 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:25:36,419 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> 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 -> bf75d7f1708750397c6bdac14ac08b964b10a95dcecc15b57a02c9969977c6ec [2021-10-29 05:25:36,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:25:36,746 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:25:36,749 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:25:36,750 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:25:36,752 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:25:36,753 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-10-29 05:25:36,837 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/data/30f9a9d44/ce56194ee1e54a9c9eb830d97f3917d9/FLAGd40e99533 [2021-10-29 05:25:37,529 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:25:37,530 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c [2021-10-29 05:25:37,556 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/data/30f9a9d44/ce56194ee1e54a9c9eb830d97f3917d9/FLAGd40e99533 [2021-10-29 05:25:37,810 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/data/30f9a9d44/ce56194ee1e54a9c9eb830d97f3917d9 [2021-10-29 05:25:37,814 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:25:37,816 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:25:37,817 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:25:37,818 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:25:37,822 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:25:37,823 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:25:37" (1/1) ... [2021-10-29 05:25:37,825 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9d4206 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:37, skipping insertion in model container [2021-10-29 05:25:37,825 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:25:37" (1/1) ... [2021-10-29 05:25:37,835 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:25:37,889 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:25:38,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-10-29 05:25:38,293 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:25:38,301 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:25:38,376 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/sv-benchmarks/c/ntdrivers-simplified/kbfiltr_simpl2.cil-1.c[29620,29633] [2021-10-29 05:25:38,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:25:38,393 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:25:38,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38 WrapperNode [2021-10-29 05:25:38,394 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:25:38,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:25:38,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:25:38,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:25:38,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,425 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,546 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:25:38,547 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:25:38,547 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:25:38,548 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:25:38,558 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,559 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,597 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,611 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,623 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,633 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:25:38,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:25:38,645 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:25:38,645 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:25:38,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (1/1) ... [2021-10-29 05:25:38,656 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:25:38,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:25:38,688 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:25:38,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:25:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:25:38,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:25:38,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:25:38,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:25:38,960 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:38,971 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:38,983 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,010 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,017 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,025 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,046 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,060 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,065 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,068 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,071 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:39,096 WARN L805 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2021-10-29 05:25:40,214 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##249: assume false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##250: assume !false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##279: assume false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##280: assume !false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##219: assume false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##220: assume !false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##302: assume !false; [2021-10-29 05:25:40,215 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##301: assume false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##322: assume !false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##321: assume false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##191: assume false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##192: assume !false; [2021-10-29 05:25:40,216 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##46: assume !false; [2021-10-29 05:25:40,217 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume false; [2021-10-29 05:25:40,217 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##140: assume false; [2021-10-29 05:25:40,217 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##141: assume !false; [2021-10-29 05:25:40,217 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##389: assume !false; [2021-10-29 05:25:40,217 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##388: assume false; [2021-10-29 05:25:40,217 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2021-10-29 05:25:40,218 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2021-10-29 05:25:40,218 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##162: assume !false; [2021-10-29 05:25:40,218 INFO L758 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##161: assume false; [2021-10-29 05:25:41,315 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:25:41,316 INFO L299 CfgBuilder]: Removed 152 assume(true) statements. [2021-10-29 05:25:41,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:25:41 BoogieIcfgContainer [2021-10-29 05:25:41,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:25:41,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:25:41,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:25:41,328 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:25:41,329 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:25:37" (1/3) ... [2021-10-29 05:25:41,330 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1703ea5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:25:41, skipping insertion in model container [2021-10-29 05:25:41,330 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:25:38" (2/3) ... [2021-10-29 05:25:41,332 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1703ea5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:25:41, skipping insertion in model container [2021-10-29 05:25:41,332 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:25:41" (3/3) ... [2021-10-29 05:25:41,334 INFO L111 eAbstractionObserver]: Analyzing ICFG kbfiltr_simpl2.cil-1.c [2021-10-29 05:25:41,347 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:25:41,347 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2021-10-29 05:25:41,430 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:25:41,440 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:25:41,441 INFO L340 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2021-10-29 05:25:41,472 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 168 states have (on average 1.7797619047619047) internal successors, (299), 197 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:41,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:25:41,481 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:41,482 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:41,483 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:41,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:41,490 INFO L85 PathProgramCache]: Analyzing trace with hash -596333414, now seen corresponding path program 1 times [2021-10-29 05:25:41,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:41,514 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697212660] [2021-10-29 05:25:41,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:41,516 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:41,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:41,794 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:41,795 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697212660] [2021-10-29 05:25:41,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697212660] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:41,796 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:41,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:41,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407851193] [2021-10-29 05:25:41,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:41,805 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:41,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:41,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:41,824 INFO L87 Difference]: Start difference. First operand has 198 states, 168 states have (on average 1.7797619047619047) internal successors, (299), 197 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:42,121 INFO L93 Difference]: Finished difference Result 349 states and 520 transitions. [2021-10-29 05:25:42,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:42,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-10-29 05:25:42,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:42,142 INFO L225 Difference]: With dead ends: 349 [2021-10-29 05:25:42,142 INFO L226 Difference]: Without dead ends: 180 [2021-10-29 05:25:42,147 INFO L786 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 [2021-10-29 05:25:42,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-10-29 05:25:42,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2021-10-29 05:25:42,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 161 states have (on average 1.4968944099378882) internal successors, (241), 179 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 241 transitions. [2021-10-29 05:25:42,223 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 241 transitions. Word has length 9 [2021-10-29 05:25:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:42,224 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 241 transitions. [2021-10-29 05:25:42,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 241 transitions. [2021-10-29 05:25:42,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:25:42,226 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:42,226 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:42,226 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:25:42,227 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:42,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:42,227 INFO L85 PathProgramCache]: Analyzing trace with hash -125871233, now seen corresponding path program 1 times [2021-10-29 05:25:42,228 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:42,228 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418359596] [2021-10-29 05:25:42,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:42,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:42,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:42,303 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:42,303 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418359596] [2021-10-29 05:25:42,304 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418359596] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:42,304 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:42,304 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:42,305 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112080632] [2021-10-29 05:25:42,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:42,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:42,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:42,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:42,312 INFO L87 Difference]: Start difference. First operand 180 states and 241 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:42,397 INFO L93 Difference]: Finished difference Result 276 states and 361 transitions. [2021-10-29 05:25:42,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:42,400 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 05:25:42,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:42,404 INFO L225 Difference]: With dead ends: 276 [2021-10-29 05:25:42,406 INFO L226 Difference]: Without dead ends: 182 [2021-10-29 05:25:42,407 INFO L786 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 [2021-10-29 05:25:42,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2021-10-29 05:25:42,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2021-10-29 05:25:42,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 139 states have (on average 1.4172661870503598) internal successors, (197), 149 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 197 transitions. [2021-10-29 05:25:42,434 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 197 transitions. Word has length 10 [2021-10-29 05:25:42,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:42,435 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 197 transitions. [2021-10-29 05:25:42,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 197 transitions. [2021-10-29 05:25:42,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:25:42,437 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:42,437 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:42,438 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:25:42,438 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:42,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:42,449 INFO L85 PathProgramCache]: Analyzing trace with hash 895831734, now seen corresponding path program 1 times [2021-10-29 05:25:42,449 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:42,450 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [264996134] [2021-10-29 05:25:42,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:42,451 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:42,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:42,513 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:42,513 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:42,513 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [264996134] [2021-10-29 05:25:42,514 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [264996134] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:42,515 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:42,515 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:25:42,515 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59211284] [2021-10-29 05:25:42,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:42,516 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:42,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:42,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:42,520 INFO L87 Difference]: Start difference. First operand 150 states and 197 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:42,543 INFO L93 Difference]: Finished difference Result 163 states and 213 transitions. [2021-10-29 05:25:42,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:42,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-10-29 05:25:42,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:42,547 INFO L225 Difference]: With dead ends: 163 [2021-10-29 05:25:42,547 INFO L226 Difference]: Without dead ends: 150 [2021-10-29 05:25:42,548 INFO L786 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 [2021-10-29 05:25:42,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-29 05:25:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-10-29 05:25:42,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 139 states have (on average 1.410071942446043) internal successors, (196), 149 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 196 transitions. [2021-10-29 05:25:42,577 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 196 transitions. Word has length 10 [2021-10-29 05:25:42,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:42,577 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 196 transitions. [2021-10-29 05:25:42,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,578 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 196 transitions. [2021-10-29 05:25:42,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-10-29 05:25:42,584 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:42,584 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:42,585 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:25:42,586 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:42,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:42,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1805126309, now seen corresponding path program 1 times [2021-10-29 05:25:42,588 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:42,588 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996759050] [2021-10-29 05:25:42,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:42,588 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:42,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:42,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:42,669 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:42,669 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996759050] [2021-10-29 05:25:42,670 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996759050] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:42,670 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:42,670 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:42,670 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218030894] [2021-10-29 05:25:42,671 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:42,671 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:42,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:42,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:42,672 INFO L87 Difference]: Start difference. First operand 150 states and 196 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:42,767 INFO L93 Difference]: Finished difference Result 150 states and 196 transitions. [2021-10-29 05:25:42,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:42,768 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-10-29 05:25:42,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:42,769 INFO L225 Difference]: With dead ends: 150 [2021-10-29 05:25:42,769 INFO L226 Difference]: Without dead ends: 136 [2021-10-29 05:25:42,770 INFO L786 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 [2021-10-29 05:25:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2021-10-29 05:25:42,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2021-10-29 05:25:42,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 132 states have (on average 1.378787878787879) internal successors, (182), 135 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 182 transitions. [2021-10-29 05:25:42,780 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 182 transitions. Word has length 15 [2021-10-29 05:25:42,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:42,780 INFO L470 AbstractCegarLoop]: Abstraction has 136 states and 182 transitions. [2021-10-29 05:25:42,780 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,781 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 182 transitions. [2021-10-29 05:25:42,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 05:25:42,782 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:42,782 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:42,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:25:42,782 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:42,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:42,783 INFO L85 PathProgramCache]: Analyzing trace with hash 345633206, now seen corresponding path program 1 times [2021-10-29 05:25:42,783 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:42,784 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520630070] [2021-10-29 05:25:42,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:42,784 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:42,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:42,835 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:42,836 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520630070] [2021-10-29 05:25:42,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520630070] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:42,836 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:42,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:42,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539891367] [2021-10-29 05:25:42,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:42,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:42,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:42,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:42,838 INFO L87 Difference]: Start difference. First operand 136 states and 182 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:42,929 INFO L93 Difference]: Finished difference Result 166 states and 219 transitions. [2021-10-29 05:25:42,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:42,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-29 05:25:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:42,931 INFO L225 Difference]: With dead ends: 166 [2021-10-29 05:25:42,932 INFO L226 Difference]: Without dead ends: 133 [2021-10-29 05:25:42,932 INFO L786 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 [2021-10-29 05:25:42,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-10-29 05:25:42,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-10-29 05:25:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 130 states have (on average 1.3692307692307693) internal successors, (178), 132 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 178 transitions. [2021-10-29 05:25:42,941 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 178 transitions. Word has length 18 [2021-10-29 05:25:42,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:42,941 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 178 transitions. [2021-10-29 05:25:42,942 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 178 transitions. [2021-10-29 05:25:42,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-29 05:25:42,943 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:42,943 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:42,943 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:25:42,944 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:42,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:42,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1337949913, now seen corresponding path program 1 times [2021-10-29 05:25:42,944 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:42,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485933165] [2021-10-29 05:25:42,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:42,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:42,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:42,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:42,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:42,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485933165] [2021-10-29 05:25:42,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485933165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:42,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:42,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:42,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236492844] [2021-10-29 05:25:42,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:42,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:42,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:42,991 INFO L87 Difference]: Start difference. First operand 133 states and 178 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,029 INFO L93 Difference]: Finished difference Result 179 states and 234 transitions. [2021-10-29 05:25:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:43,030 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-10-29 05:25:43,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,031 INFO L225 Difference]: With dead ends: 179 [2021-10-29 05:25:43,032 INFO L226 Difference]: Without dead ends: 147 [2021-10-29 05:25:43,032 INFO L786 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 [2021-10-29 05:25:43,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-10-29 05:25:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 133. [2021-10-29 05:25:43,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 130 states have (on average 1.3615384615384616) internal successors, (177), 132 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2021-10-29 05:25:43,043 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 18 [2021-10-29 05:25:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:43,043 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2021-10-29 05:25:43,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2021-10-29 05:25:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-10-29 05:25:43,044 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:43,044 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:43,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:25:43,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash -947103727, now seen corresponding path program 1 times [2021-10-29 05:25:43,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:43,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412010978] [2021-10-29 05:25:43,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:43,051 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:43,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:43,170 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:43,171 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412010978] [2021-10-29 05:25:43,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412010978] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:43,172 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:43,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:43,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295421004] [2021-10-29 05:25:43,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:43,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:43,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:43,175 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,198 INFO L93 Difference]: Finished difference Result 177 states and 231 transitions. [2021-10-29 05:25:43,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:43,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-10-29 05:25:43,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,200 INFO L225 Difference]: With dead ends: 177 [2021-10-29 05:25:43,201 INFO L226 Difference]: Without dead ends: 145 [2021-10-29 05:25:43,204 INFO L786 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 [2021-10-29 05:25:43,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2021-10-29 05:25:43,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 131. [2021-10-29 05:25:43,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.359375) internal successors, (174), 130 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2021-10-29 05:25:43,215 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 19 [2021-10-29 05:25:43,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:43,216 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2021-10-29 05:25:43,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,216 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2021-10-29 05:25:43,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-29 05:25:43,217 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:43,218 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:43,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:25:43,218 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:43,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:43,219 INFO L85 PathProgramCache]: Analyzing trace with hash -2134817482, now seen corresponding path program 1 times [2021-10-29 05:25:43,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:43,219 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071934421] [2021-10-29 05:25:43,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:43,220 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:43,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:43,325 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:43,325 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071934421] [2021-10-29 05:25:43,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071934421] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:43,326 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:43,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:43,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125644800] [2021-10-29 05:25:43,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:43,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:43,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:43,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:43,334 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,481 INFO L93 Difference]: Finished difference Result 161 states and 211 transitions. [2021-10-29 05:25:43,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:43,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2021-10-29 05:25:43,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,484 INFO L225 Difference]: With dead ends: 161 [2021-10-29 05:25:43,485 INFO L226 Difference]: Without dead ends: 131 [2021-10-29 05:25:43,486 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:43,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-29 05:25:43,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-10-29 05:25:43,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 128 states have (on average 1.3515625) internal successors, (173), 130 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 173 transitions. [2021-10-29 05:25:43,499 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 173 transitions. Word has length 20 [2021-10-29 05:25:43,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:43,500 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 173 transitions. [2021-10-29 05:25:43,500 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 173 transitions. [2021-10-29 05:25:43,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:25:43,502 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:43,502 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:43,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:25:43,503 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:43,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:43,503 INFO L85 PathProgramCache]: Analyzing trace with hash 533053490, now seen corresponding path program 1 times [2021-10-29 05:25:43,504 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:43,504 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665970594] [2021-10-29 05:25:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:43,505 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:43,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:43,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:43,542 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:43,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665970594] [2021-10-29 05:25:43,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665970594] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:43,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:43,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:43,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206205616] [2021-10-29 05:25:43,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:43,544 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:43,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:43,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:43,545 INFO L87 Difference]: Start difference. First operand 131 states and 173 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,571 INFO L93 Difference]: Finished difference Result 138 states and 183 transitions. [2021-10-29 05:25:43,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:43,572 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 05:25:43,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,573 INFO L225 Difference]: With dead ends: 138 [2021-10-29 05:25:43,573 INFO L226 Difference]: Without dead ends: 29 [2021-10-29 05:25:43,574 INFO L786 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 [2021-10-29 05:25:43,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-10-29 05:25:43,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-10-29 05:25:43,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 28 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2021-10-29 05:25:43,577 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 21 [2021-10-29 05:25:43,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:43,578 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2021-10-29 05:25:43,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,578 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2021-10-29 05:25:43,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-10-29 05:25:43,579 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:43,579 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:43,580 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:25:43,580 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:43,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:43,581 INFO L85 PathProgramCache]: Analyzing trace with hash 1946876568, now seen corresponding path program 1 times [2021-10-29 05:25:43,581 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:43,581 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164142636] [2021-10-29 05:25:43,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:43,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:43,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:43,760 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:43,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164142636] [2021-10-29 05:25:43,761 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164142636] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:43,761 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:43,761 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:25:43,761 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742044419] [2021-10-29 05:25:43,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:25:43,762 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:43,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:25:43,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:25:43,763 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,827 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2021-10-29 05:25:43,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:25:43,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-10-29 05:25:43,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,831 INFO L225 Difference]: With dead ends: 33 [2021-10-29 05:25:43,831 INFO L226 Difference]: Without dead ends: 29 [2021-10-29 05:25:43,832 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:25:43,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-10-29 05:25:43,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-10-29 05:25:43,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 27 states have (on average 1.0740740740740742) internal successors, (29), 28 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2021-10-29 05:25:43,836 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 21 [2021-10-29 05:25:43,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:43,836 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2021-10-29 05:25:43,837 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,837 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2021-10-29 05:25:43,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-10-29 05:25:43,838 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:43,838 INFO L513 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] [2021-10-29 05:25:43,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:25:43,839 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:43,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:43,839 INFO L85 PathProgramCache]: Analyzing trace with hash 158373879, now seen corresponding path program 1 times [2021-10-29 05:25:43,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:43,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859062488] [2021-10-29 05:25:43,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:43,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:43,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:43,888 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:43,888 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859062488] [2021-10-29 05:25:43,889 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859062488] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:43,889 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:43,889 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:43,889 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799031536] [2021-10-29 05:25:43,890 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:43,890 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:43,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:43,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:43,893 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,910 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2021-10-29 05:25:43,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:43,910 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2021-10-29 05:25:43,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,911 INFO L225 Difference]: With dead ends: 33 [2021-10-29 05:25:43,912 INFO L226 Difference]: Without dead ends: 31 [2021-10-29 05:25:43,912 INFO L786 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 [2021-10-29 05:25:43,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-10-29 05:25:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2021-10-29 05:25:43,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.0689655172413792) internal successors, (31), 30 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2021-10-29 05:25:43,933 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 22 [2021-10-29 05:25:43,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:43,934 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2021-10-29 05:25:43,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2021-10-29 05:25:43,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-29 05:25:43,935 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:43,935 INFO L513 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] [2021-10-29 05:25:43,936 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:25:43,936 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:43,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:43,937 INFO L85 PathProgramCache]: Analyzing trace with hash 606964236, now seen corresponding path program 1 times [2021-10-29 05:25:43,937 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:43,937 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263228832] [2021-10-29 05:25:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:43,938 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:43,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:43,986 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:43,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263228832] [2021-10-29 05:25:43,986 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263228832] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:43,987 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:43,987 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:25:43,987 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884371490] [2021-10-29 05:25:43,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:25:43,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:43,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:25:43,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:25:43,990 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:43,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:43,997 INFO L93 Difference]: Finished difference Result 36 states and 35 transitions. [2021-10-29 05:25:43,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:25:43,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-10-29 05:25:43,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:43,999 INFO L225 Difference]: With dead ends: 36 [2021-10-29 05:25:43,999 INFO L226 Difference]: Without dead ends: 26 [2021-10-29 05:25:44,000 INFO L786 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 [2021-10-29 05:25:44,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2021-10-29 05:25:44,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2021-10-29 05:25:44,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.0) internal successors, (25), 25 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:44,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 25 transitions. [2021-10-29 05:25:44,004 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 25 transitions. Word has length 23 [2021-10-29 05:25:44,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:44,004 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 25 transitions. [2021-10-29 05:25:44,004 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 25 transitions. [2021-10-29 05:25:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-29 05:25:44,008 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:25:44,008 INFO L513 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] [2021-10-29 05:25:44,009 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-29 05:25:44,009 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2021-10-29 05:25:44,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:25:44,010 INFO L85 PathProgramCache]: Analyzing trace with hash -2020670576, now seen corresponding path program 1 times [2021-10-29 05:25:44,010 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:25:44,010 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875810935] [2021-10-29 05:25:44,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:25:44,011 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:25:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:25:44,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:25:44,073 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:25:44,074 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875810935] [2021-10-29 05:25:44,074 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875810935] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:25:44,074 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:25:44,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:25:44,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201152638] [2021-10-29 05:25:44,075 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:25:44,075 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:25:44,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:25:44,076 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:44,077 INFO L87 Difference]: Start difference. First operand 26 states and 25 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:44,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:25:44,093 INFO L93 Difference]: Finished difference Result 26 states and 25 transitions. [2021-10-29 05:25:44,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:25:44,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2021-10-29 05:25:44,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:25:44,097 INFO L225 Difference]: With dead ends: 26 [2021-10-29 05:25:44,097 INFO L226 Difference]: Without dead ends: 0 [2021-10-29 05:25:44,097 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:25:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-29 05:25:44,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-29 05:25:44,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-29 05:25:44,099 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2021-10-29 05:25:44,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:25:44,099 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-29 05:25:44,100 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:25:44,100 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-29 05:25:44,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-29 05:25:44,103 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,104 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,105 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,106 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,107 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,108 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,109 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,110 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,111 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,111 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,111 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,112 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,112 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,112 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,112 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,113 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION [2021-10-29 05:25:44,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-29 05:25:44,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2021-10-29 05:25:44,121 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,126 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,130 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,133 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,138 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,141 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,146 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,148 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,155 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,166 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,167 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,168 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,171 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,173 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,174 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,176 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,178 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,180 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,197 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,199 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,203 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,206 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,210 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,213 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,214 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,215 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,216 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,217 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,218 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,219 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,222 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,224 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,226 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,227 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,228 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,233 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,235 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,241 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,242 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,243 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,245 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,246 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,247 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,248 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,250 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,254 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,255 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,256 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,261 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,262 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,265 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,267 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,268 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,269 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,270 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,273 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,279 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,280 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,282 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout 10000 ms and remaining time -1 ms [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point L432(lines 432 459) no Hoare annotation was computed. [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point L433(lines 433 439) no Hoare annotation was computed. [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr23ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point L896(lines 896 984) no Hoare annotation was computed. [2021-10-29 05:25:44,926 INFO L857 garLoopResultBuilder]: For program point L434(lines 434 436) no Hoare annotation was computed. [2021-10-29 05:25:44,927 INFO L853 garLoopResultBuilder]: At program point L368(lines 368 409) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,927 INFO L853 garLoopResultBuilder]: At program point L171(lines 117 288) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,927 INFO L857 garLoopResultBuilder]: For program point L239(lines 239 245) no Hoare annotation was computed. [2021-10-29 05:25:44,927 INFO L853 garLoopResultBuilder]: At program point L108(lines 108 291) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,927 INFO L853 garLoopResultBuilder]: At program point L373(lines 373 408) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,927 INFO L857 garLoopResultBuilder]: For program point L638(lines 638 656) no Hoare annotation was computed. [2021-10-29 05:25:44,927 INFO L857 garLoopResultBuilder]: For program point L638-1(lines 638 656) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point L903(lines 903 982) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L853 garLoopResultBuilder]: At program point L441(lines 432 459) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point L177(lines 177 189) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L853 garLoopResultBuilder]: At program point L111(lines 111 290) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr14ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point L641(lines 641 655) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point L641-1(lines 641 655) no Hoare annotation was computed. [2021-10-29 05:25:44,928 INFO L857 garLoopResultBuilder]: For program point L443(lines 443 447) no Hoare annotation was computed. [2021-10-29 05:25:44,929 INFO L853 garLoopResultBuilder]: At program point L972(lines 867 1006) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,929 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr25ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,929 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,929 INFO L853 garLoopResultBuilder]: At program point L114(lines 114 289) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,929 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr16ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,929 INFO L857 garLoopResultBuilder]: For program point L644(lines 644 654) no Hoare annotation was computed. [2021-10-29 05:25:44,929 INFO L857 garLoopResultBuilder]: For program point L644-1(lines 644 654) no Hoare annotation was computed. [2021-10-29 05:25:44,929 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr27ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,930 INFO L857 garLoopResultBuilder]: For program point L182(lines 182 188) no Hoare annotation was computed. [2021-10-29 05:25:44,930 INFO L853 garLoopResultBuilder]: At program point L182-1(lines 1 1016) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,930 INFO L853 garLoopResultBuilder]: At program point L645(lines 638 656) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,930 INFO L853 garLoopResultBuilder]: At program point L645-1(lines 638 656) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,930 INFO L857 garLoopResultBuilder]: For program point L910(lines 910 980) no Hoare annotation was computed. [2021-10-29 05:25:44,930 INFO L857 garLoopResultBuilder]: For program point L581(lines 581 600) no Hoare annotation was computed. [2021-10-29 05:25:44,930 INFO L857 garLoopResultBuilder]: For program point L582(lines 582 587) no Hoare annotation was computed. [2021-10-29 05:25:44,930 INFO L853 garLoopResultBuilder]: At program point L54(lines 347 349) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,931 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2021-10-29 05:25:44,931 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,931 INFO L857 garLoopResultBuilder]: For program point L917(lines 917 978) no Hoare annotation was computed. [2021-10-29 05:25:44,931 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr18ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,931 INFO L853 garLoopResultBuilder]: At program point L653(lines 641 655) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,931 INFO L853 garLoopResultBuilder]: At program point L653-1(lines 641 655) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,931 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,931 INFO L853 garLoopResultBuilder]: At program point L589(lines 581 600) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (not (= ~MPR3~0 ~s~0))) [2021-10-29 05:25:44,932 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr20ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524-1(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524-2(lines 488 552) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~MPR1~0 ~s~0)) [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524-3(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524-4(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524-5(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,932 INFO L853 garLoopResultBuilder]: At program point L524-6(lines 488 552) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,933 INFO L853 garLoopResultBuilder]: At program point L789(lines 753 820) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,933 INFO L853 garLoopResultBuilder]: At program point L724(lines 699 743) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,933 INFO L857 garLoopResultBuilder]: For program point L924(lines 924 976) no Hoare annotation was computed. [2021-10-29 05:25:44,933 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,933 INFO L857 garLoopResultBuilder]: For program point L594(lines 594 598) no Hoare annotation was computed. [2021-10-29 05:25:44,933 INFO L853 garLoopResultBuilder]: At program point L594-1(lines 594 598) the Hoare annotation is: (and (= ~compRegistered~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,933 INFO L853 garLoopResultBuilder]: At program point L330(lines 324 465) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,933 INFO L857 garLoopResultBuilder]: For program point L199(lines 199 205) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L199-2(lines 172 268) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L860 garLoopResultBuilder]: At program point L464(lines 295 466) the Hoare annotation is: true [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532-1(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532-2(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532-3(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532-4(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532-5(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L532-6(lines 532 549) no Hoare annotation was computed. [2021-10-29 05:25:44,934 INFO L857 garLoopResultBuilder]: For program point L797(lines 797 817) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L853 garLoopResultBuilder]: At program point L269(lines 172 270) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr22ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point L931(lines 931 974) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr24ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point L471(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point L471-2(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point L471-4(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,935 INFO L857 garLoopResultBuilder]: For program point L471-6(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point L471-8(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point L471-10(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point L471-12(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point L471-14(lines 471 477) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point L934(lines 934 973) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L853 garLoopResultBuilder]: At program point L76(lines 330 413) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0) (not (= ~MPR3~0 ~s~0))) [2021-10-29 05:25:44,936 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,936 INFO L853 garLoopResultBuilder]: At program point L935(lines 875 990) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr15ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point L541(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point L541-2(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point L541-4(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point L541-6(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,937 INFO L857 garLoopResultBuilder]: For program point L541-8(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,939 INFO L857 garLoopResultBuilder]: For program point L541-10(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,940 INFO L857 garLoopResultBuilder]: For program point L541-12(lines 541 548) no Hoare annotation was computed. [2021-10-29 05:25:44,940 INFO L857 garLoopResultBuilder]: For program point L674(lines 674 680) no Hoare annotation was computed. [2021-10-29 05:25:44,940 INFO L857 garLoopResultBuilder]: For program point L674-2(lines 674 680) no Hoare annotation was computed. [2021-10-29 05:25:44,940 INFO L857 garLoopResultBuilder]: For program point L674-4(lines 674 680) no Hoare annotation was computed. [2021-10-29 05:25:44,940 INFO L853 garLoopResultBuilder]: At program point L1005(lines 822 1007) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,940 INFO L857 garLoopResultBuilder]: For program point L875(lines 875 990) no Hoare annotation was computed. [2021-10-29 05:25:44,941 INFO L857 garLoopResultBuilder]: For program point L809(lines 809 816) no Hoare annotation was computed. [2021-10-29 05:25:44,941 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr26ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,941 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr28ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,941 INFO L857 garLoopResultBuilder]: For program point L415(lines 415 419) no Hoare annotation was computed. [2021-10-29 05:25:44,941 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2021-10-29 05:25:44,941 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,942 INFO L857 garLoopResultBuilder]: For program point L1013(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,942 INFO L857 garLoopResultBuilder]: For program point L1013-1(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,942 INFO L857 garLoopResultBuilder]: For program point L1013-2(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,942 INFO L857 garLoopResultBuilder]: For program point L1013-3(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,942 INFO L857 garLoopResultBuilder]: For program point L1013-4(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,942 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr17ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-5(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-6(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-7(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-8(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-9(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-10(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,943 INFO L857 garLoopResultBuilder]: For program point L1013-11(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-12(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-13(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-14(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-15(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-16(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-17(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,944 INFO L857 garLoopResultBuilder]: For program point L1013-18(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,945 INFO L857 garLoopResultBuilder]: For program point L1013-19(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,945 INFO L853 garLoopResultBuilder]: At program point L353(lines 353 412) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,945 INFO L857 garLoopResultBuilder]: For program point L1013-20(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,945 INFO L857 garLoopResultBuilder]: For program point L1013-21(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,945 INFO L857 garLoopResultBuilder]: For program point L1013-22(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,945 INFO L857 garLoopResultBuilder]: For program point L1013-23(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,946 INFO L857 garLoopResultBuilder]: For program point L1013-24(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,946 INFO L857 garLoopResultBuilder]: For program point L1013-25(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,946 INFO L857 garLoopResultBuilder]: For program point L1013-26(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,946 INFO L857 garLoopResultBuilder]: For program point L1013-27(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,946 INFO L857 garLoopResultBuilder]: For program point L1013-28(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,946 INFO L853 garLoopResultBuilder]: At program point L1014(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,947 INFO L853 garLoopResultBuilder]: At program point L1014-2(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,947 INFO L853 garLoopResultBuilder]: At program point L1014-3(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,947 INFO L853 garLoopResultBuilder]: At program point L1014-5(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,947 INFO L853 garLoopResultBuilder]: At program point L1014-9(lines 1 1016) the Hoare annotation is: (let ((.cse0 (= ~s~0 ~NP~0))) (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (or (and (<= 259 ULTIMATE.start_IofCallDriver_~returnVal2~0) (<= ULTIMATE.start_IofCallDriver_~returnVal2~0 259)) .cse0) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (or .cse0 (= ~MPR3~0 ~s~0)) (<= (+ ~NP~0 4) ~MPR1~0))) [2021-10-29 05:25:44,947 INFO L853 garLoopResultBuilder]: At program point L1014-12(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,948 INFO L853 garLoopResultBuilder]: At program point L1014-14(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,948 INFO L853 garLoopResultBuilder]: At program point L1014-15(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,948 INFO L853 garLoopResultBuilder]: At program point L1014-17(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,948 INFO L853 garLoopResultBuilder]: At program point L1014-18(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,948 INFO L853 garLoopResultBuilder]: At program point L1014-20(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,949 INFO L853 garLoopResultBuilder]: At program point L1014-21(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,949 INFO L853 garLoopResultBuilder]: At program point L1014-23(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,949 INFO L853 garLoopResultBuilder]: At program point L1014-24(lines 554 567) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,949 INFO L853 garLoopResultBuilder]: At program point L1014-25(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,949 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,950 INFO L853 garLoopResultBuilder]: At program point L1014-27(lines 1 1016) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,950 INFO L853 garLoopResultBuilder]: At program point L883(lines 883 988) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,950 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr19ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,950 INFO L853 garLoopResultBuilder]: At program point L421(lines 414 463) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,950 INFO L857 garLoopResultBuilder]: For program point L223(lines 223 229) no Hoare annotation was computed. [2021-10-29 05:25:44,951 INFO L853 garLoopResultBuilder]: At program point L489(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,951 INFO L853 garLoopResultBuilder]: At program point L489-1(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,951 INFO L853 garLoopResultBuilder]: At program point L489-2(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,951 INFO L857 garLoopResultBuilder]: For program point L423(lines 423 427) no Hoare annotation was computed. [2021-10-29 05:25:44,951 INFO L853 garLoopResultBuilder]: At program point L489-3(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,952 INFO L853 garLoopResultBuilder]: At program point L489-4(lines 489 501) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,952 INFO L853 garLoopResultBuilder]: At program point L489-5(lines 489 501) the Hoare annotation is: (and (= ~compRegistered~0 1) (= ~setEventCalled~0 1) (= (+ 1073741802 ULTIMATE.start_IofCallDriver_~__cil_tmp7~0) 0) (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~MPR1~0 ~s~0)) [2021-10-29 05:25:44,952 INFO L853 garLoopResultBuilder]: At program point L489-6(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,952 INFO L853 garLoopResultBuilder]: At program point L489-7(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,952 INFO L853 garLoopResultBuilder]: At program point L489-8(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,952 INFO L853 garLoopResultBuilder]: At program point L489-9(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,953 INFO L853 garLoopResultBuilder]: At program point L489-10(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,953 INFO L853 garLoopResultBuilder]: At program point L489-11(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,953 INFO L853 garLoopResultBuilder]: At program point L489-12(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,953 INFO L853 garLoopResultBuilder]: At program point L489-13(lines 489 501) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,953 INFO L853 garLoopResultBuilder]: At program point L754(lines 754 766) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,954 INFO L853 garLoopResultBuilder]: At program point L754-1(lines 754 766) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0) (= ~SKIP1~0 ~s~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,954 INFO L853 garLoopResultBuilder]: At program point L358(lines 358 411) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,954 INFO L857 garLoopResultBuilder]: For program point L558(lines 558 564) no Hoare annotation was computed. [2021-10-29 05:25:44,954 INFO L857 garLoopResultBuilder]: For program point L558-2(lines 558 564) no Hoare annotation was computed. [2021-10-29 05:25:44,954 INFO L853 garLoopResultBuilder]: At program point L891(lines 891 986) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,955 INFO L857 garLoopResultBuilder]: For program point L495(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,955 INFO L857 garLoopResultBuilder]: For program point L495-2(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,955 INFO L853 garLoopResultBuilder]: At program point L429(lines 422 462) the Hoare annotation is: (and (not (= ~pended~0 1)) (<= (+ ~NP~0 4) ~MPR1~0)) [2021-10-29 05:25:44,955 INFO L853 garLoopResultBuilder]: At program point L363(lines 363 410) the Hoare annotation is: (and (= ULTIMATE.start_main_~status~1 0) (not (= ~pended~0 1)) (= ~s~0 ~NP~0) (<= (+ ~NP~0 4) ~MPR1~0) (= ~compRegistered~0 0)) [2021-10-29 05:25:44,955 INFO L857 garLoopResultBuilder]: For program point L495-4(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,955 INFO L857 garLoopResultBuilder]: For program point L495-6(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,956 INFO L857 garLoopResultBuilder]: For program point L495-8(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,956 INFO L857 garLoopResultBuilder]: For program point L495-10(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,956 INFO L857 garLoopResultBuilder]: For program point L495-12(lines 495 499) no Hoare annotation was computed. [2021-10-29 05:25:44,956 INFO L857 garLoopResultBuilder]: For program point L760(lines 760 764) no Hoare annotation was computed. [2021-10-29 05:25:44,956 INFO L860 garLoopResultBuilder]: At program point L430(lines 414 463) the Hoare annotation is: true [2021-10-29 05:25:44,956 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,957 INFO L857 garLoopResultBuilder]: For program point L431(lines 431 460) no Hoare annotation was computed. [2021-10-29 05:25:44,957 INFO L857 garLoopResultBuilder]: For program point ULTIMATE.startErr21ASSERT_VIOLATIONERROR_FUNCTION(line 1013) no Hoare annotation was computed. [2021-10-29 05:25:44,960 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:25:44,962 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:25:45,002 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:25:45 BoogieIcfgContainer [2021-10-29 05:25:45,002 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:25:45,003 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:25:45,003 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:25:45,003 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:25:45,003 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:25:41" (3/4) ... [2021-10-29 05:25:45,006 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-29 05:25:45,052 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 151 nodes and edges [2021-10-29 05:25:45,056 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2021-10-29 05:25:45,059 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-29 05:25:45,063 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-29 05:25:45,240 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:25:45,241 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:25:45,242 INFO L168 Benchmark]: Toolchain (without parser) took 7425.96 ms. Allocated memory was 96.5 MB in the beginning and 153.1 MB in the end (delta: 56.6 MB). Free memory was 73.6 MB in the beginning and 96.4 MB in the end (delta: -22.7 MB). Peak memory consumption was 81.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,243 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 96.5 MB. Free memory is still 70.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:25:45,243 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.29 ms. Allocated memory is still 96.5 MB. Free memory was 73.6 MB in the beginning and 65.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,244 INFO L168 Benchmark]: Boogie Procedure Inliner took 150.83 ms. Allocated memory is still 96.5 MB. Free memory was 65.6 MB in the beginning and 59.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,244 INFO L168 Benchmark]: Boogie Preprocessor took 96.27 ms. Allocated memory is still 96.5 MB. Free memory was 59.3 MB in the beginning and 55.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,245 INFO L168 Benchmark]: RCFGBuilder took 2676.88 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 55.4 MB in the beginning and 79.6 MB in the end (delta: -24.2 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,245 INFO L168 Benchmark]: TraceAbstraction took 3678.68 ms. Allocated memory was 117.4 MB in the beginning and 153.1 MB in the end (delta: 35.7 MB). Free memory was 79.6 MB in the beginning and 50.4 MB in the end (delta: 29.2 MB). Peak memory consumption was 64.6 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,246 INFO L168 Benchmark]: Witness Printer took 238.22 ms. Allocated memory is still 153.1 MB. Free memory was 50.4 MB in the beginning and 96.4 MB in the end (delta: -46.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:25:45,248 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 96.5 MB. Free memory is still 70.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 577.29 ms. Allocated memory is still 96.5 MB. Free memory was 73.6 MB in the beginning and 65.6 MB in the end (delta: 8.0 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 150.83 ms. Allocated memory is still 96.5 MB. Free memory was 65.6 MB in the beginning and 59.3 MB in the end (delta: 6.3 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 96.27 ms. Allocated memory is still 96.5 MB. Free memory was 59.3 MB in the beginning and 55.4 MB in the end (delta: 3.9 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2676.88 ms. Allocated memory was 96.5 MB in the beginning and 117.4 MB in the end (delta: 21.0 MB). Free memory was 55.4 MB in the beginning and 79.6 MB in the end (delta: -24.2 MB). Peak memory consumption was 39.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3678.68 ms. Allocated memory was 117.4 MB in the beginning and 153.1 MB in the end (delta: 35.7 MB). Free memory was 79.6 MB in the beginning and 50.4 MB in the end (delta: 29.2 MB). Peak memory consumption was 64.6 MB. Max. memory is 16.1 GB. * Witness Printer took 238.22 ms. Allocated memory is still 153.1 MB. Free memory was 50.4 MB in the beginning and 96.4 MB in the end (delta: -46.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - PositiveResult [Line: 1013]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 198 locations, 29 error locations. Started 1 CEGAR loops. OverallTime: 3.5s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.8s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1676 SDtfs, 925 SDslu, 757 SDs, 0 SdLazy, 446 SolverSat, 47 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=198occurred in iteration=0, InterpolantAutomatonStates: 43, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 60 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 71 LocationsWithAnnotation, 71 PreInvPairs, 131 NumberOfFragments, 1301 HoareAnnotationTreeSize, 71 FomulaSimplifications, 115 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 71 FomulaSimplificationsInter, 10 FormulaSimplificationTreeSizeReductionInter, 0.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 231 NumberOfCodeBlocks, 231 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 218 ConstructedInterpolants, 0 QuantifiedInterpolants, 422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 29 specifications checked. All of them hold - InvariantResult [Line: 347]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 753]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 875]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 891]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 581]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && setEventCalled == 1) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && !(MPR3 == s) - InvariantResult [Line: 358]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 422]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 754]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 867]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 699]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 111]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 432]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 108]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 353]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 414]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((((((compRegistered == 1 && setEventCalled == 1) && ((259 <= returnVal2 && returnVal2 <= 259) || s == NP)) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && (s == NP || MPR3 == s)) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && setEventCalled == 1) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && NP + 4 <= MPR1) && MPR1 == s - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 883]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 594]: Loop Invariant Derived loop invariant: ((((compRegistered == 1 && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1 - InvariantResult [Line: 295]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 368]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 117]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 324]: Loop Invariant Derived loop invariant: !(pended == 1) && NP + 4 <= MPR1 - InvariantResult [Line: 373]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 822]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 641]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 114]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 488]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((compRegistered == 1 && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((((compRegistered == 1 && setEventCalled == 1) && 1073741802 + __cil_tmp7 == 0) && status == 0) && !(pended == 1)) && NP + 4 <= MPR1) && MPR1 == s - InvariantResult [Line: 554]: Loop Invariant Derived loop invariant: ((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 172]: Loop Invariant Derived loop invariant: (status == 0 && !(pended == 1)) && NP + 4 <= MPR1 - InvariantResult [Line: 489]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && SKIP1 == s) && compRegistered == 0 - InvariantResult [Line: 363]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 - InvariantResult [Line: 1]: Loop Invariant Derived loop invariant: (((compRegistered == 1 && status == 0) && !(pended == 1)) && s == NP) && NP + 4 <= MPR1 - InvariantResult [Line: 330]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && NP + 4 <= MPR1) && compRegistered == 0) && !(MPR3 == s) - InvariantResult [Line: 638]: Loop Invariant Derived loop invariant: (((status == 0 && !(pended == 1)) && s == NP) && NP + 4 <= MPR1) && compRegistered == 0 RESULT: Ultimate proved your program to be correct! [2021-10-29 05:25:45,332 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5aab6cd-1f82-4000-9c22-6035a66870a8/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...