./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI --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 296e273b1c19d017b7d3722a7c74d29ba546c812 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:28:48,432 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:28:48,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:28:48,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:28:48,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:28:48,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:28:48,475 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:28:48,478 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:28:48,481 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:28:48,482 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:28:48,484 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:28:48,485 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:28:48,486 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:28:48,487 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:28:48,489 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:28:48,491 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:28:48,492 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:28:48,493 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:28:48,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:28:48,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:28:48,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:28:48,502 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:28:48,504 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:28:48,505 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:28:48,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:28:48,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:28:48,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:28:48,511 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:28:48,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:28:48,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:28:48,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:28:48,519 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:28:48,520 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:28:48,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:28:48,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:28:48,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:28:48,527 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:28:48,527 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:28:48,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:28:48,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:28:48,531 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:28:48,532 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:28:48,575 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:28:48,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:28:48,576 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:28:48,577 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:28:48,577 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:28:48,577 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:28:48,577 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:28:48,577 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:28:48,584 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:28:48,584 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:28:48,585 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:28:48,585 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:28:48,586 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:28:48,586 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:28:48,586 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:28:48,587 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:28:48,587 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:28:48,588 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:28:48,588 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:28:48,588 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:28:48,588 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:28:48,588 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:28:48,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:28:48,589 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:28:48,589 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:28:48,589 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:28:48,589 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:28:48,590 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:28:48,590 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:28:48,590 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:28:48,590 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:28:48,591 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:28:48,591 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:28:48,591 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:28:48,591 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:28:48,592 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:28:48,592 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:28:48,592 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:28:48,592 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:28:48,592 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_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/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_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI 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 -> 296e273b1c19d017b7d3722a7c74d29ba546c812 [2021-10-11 02:28:48,869 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:28:48,896 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:28:48,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:28:48,900 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:28:48,901 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:28:48,902 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/systemc/kundu1.cil.c [2021-10-11 02:28:48,979 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/data/baaf727ac/7c75a2e0828b4ad3a21a655ea4a66f8a/FLAG3bf2bf75e [2021-10-11 02:28:49,513 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:28:49,514 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/sv-benchmarks/c/systemc/kundu1.cil.c [2021-10-11 02:28:49,529 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/data/baaf727ac/7c75a2e0828b4ad3a21a655ea4a66f8a/FLAG3bf2bf75e [2021-10-11 02:28:49,826 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/data/baaf727ac/7c75a2e0828b4ad3a21a655ea4a66f8a [2021-10-11 02:28:49,831 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:28:49,833 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:28:49,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:28:49,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:28:49,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:28:49,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:28:49" (1/1) ... [2021-10-11 02:28:49,843 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b92116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:49, skipping insertion in model container [2021-10-11 02:28:49,843 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:28:49" (1/1) ... [2021-10-11 02:28:49,852 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:28:49,899 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:28:50,158 WARN L226 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_58859fb6-6e45-43ed-8de7-0e86e3fd735b/sv-benchmarks/c/systemc/kundu1.cil.c[331,344] [2021-10-11 02:28:50,270 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:28:50,289 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:28:50,303 WARN L226 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_58859fb6-6e45-43ed-8de7-0e86e3fd735b/sv-benchmarks/c/systemc/kundu1.cil.c[331,344] [2021-10-11 02:28:50,349 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:28:50,379 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:28:50,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50 WrapperNode [2021-10-11 02:28:50,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:28:50,383 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:28:50,383 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:28:50,383 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:28:50,391 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,411 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,461 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:28:50,466 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:28:50,467 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:28:50,468 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:28:50,477 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,489 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,499 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,506 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,513 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... [2021-10-11 02:28:50,520 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:28:50,521 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:28:50,521 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:28:50,521 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:28:50,523 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:28:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:28:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:28:50,610 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:28:50,611 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:28:51,987 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:28:51,987 INFO L299 CfgBuilder]: Removed 72 assume(true) statements. [2021-10-11 02:28:51,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:28:51 BoogieIcfgContainer [2021-10-11 02:28:51,990 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:28:51,992 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:28:51,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:28:51,995 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:28:51,996 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:28:49" (1/3) ... [2021-10-11 02:28:51,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7c051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:28:51, skipping insertion in model container [2021-10-11 02:28:51,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:28:50" (2/3) ... [2021-10-11 02:28:51,997 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7c051 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:28:51, skipping insertion in model container [2021-10-11 02:28:51,997 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:28:51" (3/3) ... [2021-10-11 02:28:51,999 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2021-10-11 02:28:52,013 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:28:52,017 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2021-10-11 02:28:52,029 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-11 02:28:52,054 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:28:52,054 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:28:52,054 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:28:52,054 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:28:52,055 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:28:52,055 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:28:52,055 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:28:52,055 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:28:52,070 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2021-10-11 02:28:52,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:28:52,076 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:52,077 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:28:52,077 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:52,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:52,083 INFO L82 PathProgramCache]: Analyzing trace with hash -705867676, now seen corresponding path program 1 times [2021-10-11 02:28:52,092 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:52,093 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822503927] [2021-10-11 02:28:52,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:52,344 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-11 02:28:52,345 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822503927] [2021-10-11 02:28:52,345 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:52,345 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:28:52,346 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [113647945] [2021-10-11 02:28:52,350 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:28:52,350 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:52,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:28:52,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:28:52,365 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 3 states. [2021-10-11 02:28:52,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:52,457 INFO L93 Difference]: Finished difference Result 176 states and 274 transitions. [2021-10-11 02:28:52,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:28:52,460 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2021-10-11 02:28:52,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:52,482 INFO L225 Difference]: With dead ends: 176 [2021-10-11 02:28:52,484 INFO L226 Difference]: Without dead ends: 110 [2021-10-11 02:28:52,490 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 02:28:52,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-10-11 02:28:52,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 101. [2021-10-11 02:28:52,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2021-10-11 02:28:52,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 152 transitions. [2021-10-11 02:28:52,531 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 152 transitions. Word has length 16 [2021-10-11 02:28:52,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:52,532 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 152 transitions. [2021-10-11 02:28:52,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:28:52,532 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 152 transitions. [2021-10-11 02:28:52,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-11 02:28:52,533 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:52,533 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:28:52,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:28:52,534 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:52,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:52,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1776291355, now seen corresponding path program 1 times [2021-10-11 02:28:52,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:52,536 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714625979] [2021-10-11 02:28:52,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:52,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:52,618 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-11 02:28:52,618 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714625979] [2021-10-11 02:28:52,618 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:52,618 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:52,619 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363492593] [2021-10-11 02:28:52,620 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:52,620 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:52,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:52,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:52,621 INFO L87 Difference]: Start difference. First operand 101 states and 152 transitions. Second operand 4 states. [2021-10-11 02:28:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:52,814 INFO L93 Difference]: Finished difference Result 322 states and 476 transitions. [2021-10-11 02:28:52,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:28:52,814 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2021-10-11 02:28:52,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:52,821 INFO L225 Difference]: With dead ends: 322 [2021-10-11 02:28:52,821 INFO L226 Difference]: Without dead ends: 226 [2021-10-11 02:28:52,823 INFO L677 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-11 02:28:52,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2021-10-11 02:28:52,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 161. [2021-10-11 02:28:52,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2021-10-11 02:28:52,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 236 transitions. [2021-10-11 02:28:52,867 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 236 transitions. Word has length 16 [2021-10-11 02:28:52,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:52,868 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 236 transitions. [2021-10-11 02:28:52,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:52,868 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 236 transitions. [2021-10-11 02:28:52,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:28:52,869 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:52,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:28:52,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:28:52,869 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:52,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:52,870 INFO L82 PathProgramCache]: Analyzing trace with hash 237984941, now seen corresponding path program 1 times [2021-10-11 02:28:52,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:52,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720500094] [2021-10-11 02:28:52,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:52,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:52,976 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-11 02:28:52,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720500094] [2021-10-11 02:28:52,977 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:52,977 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:52,977 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525339985] [2021-10-11 02:28:52,978 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:52,978 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:52,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:52,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:52,979 INFO L87 Difference]: Start difference. First operand 161 states and 236 transitions. Second operand 4 states. [2021-10-11 02:28:53,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:53,041 INFO L93 Difference]: Finished difference Result 562 states and 838 transitions. [2021-10-11 02:28:53,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:28:53,042 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2021-10-11 02:28:53,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:53,045 INFO L225 Difference]: With dead ends: 562 [2021-10-11 02:28:53,045 INFO L226 Difference]: Without dead ends: 410 [2021-10-11 02:28:53,047 INFO L677 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-11 02:28:53,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2021-10-11 02:28:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 261. [2021-10-11 02:28:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2021-10-11 02:28:53,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 385 transitions. [2021-10-11 02:28:53,080 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 385 transitions. Word has length 17 [2021-10-11 02:28:53,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:53,080 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 385 transitions. [2021-10-11 02:28:53,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:53,081 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 385 transitions. [2021-10-11 02:28:53,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-10-11 02:28:53,083 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:53,083 INFO L422 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] [2021-10-11 02:28:53,083 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:28:53,083 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:53,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:53,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1388616119, now seen corresponding path program 1 times [2021-10-11 02:28:53,087 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:53,087 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [322520550] [2021-10-11 02:28:53,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:53,200 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-11 02:28:53,200 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [322520550] [2021-10-11 02:28:53,201 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:53,201 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:28:53,201 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839234653] [2021-10-11 02:28:53,202 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:28:53,202 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:53,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:28:53,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:28:53,203 INFO L87 Difference]: Start difference. First operand 261 states and 385 transitions. Second operand 5 states. [2021-10-11 02:28:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:53,262 INFO L93 Difference]: Finished difference Result 458 states and 680 transitions. [2021-10-11 02:28:53,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:28:53,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2021-10-11 02:28:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:53,265 INFO L225 Difference]: With dead ends: 458 [2021-10-11 02:28:53,265 INFO L226 Difference]: Without dead ends: 306 [2021-10-11 02:28:53,272 INFO L677 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-11 02:28:53,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2021-10-11 02:28:53,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2021-10-11 02:28:53,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2021-10-11 02:28:53,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 440 transitions. [2021-10-11 02:28:53,297 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 440 transitions. Word has length 24 [2021-10-11 02:28:53,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:53,297 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 440 transitions. [2021-10-11 02:28:53,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:28:53,298 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 440 transitions. [2021-10-11 02:28:53,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:28:53,304 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:53,305 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:28:53,306 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:28:53,306 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:53,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:53,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1270845393, now seen corresponding path program 1 times [2021-10-11 02:28:53,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:53,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299594286] [2021-10-11 02:28:53,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:53,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:53,405 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:28:53,405 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299594286] [2021-10-11 02:28:53,405 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:53,406 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:28:53,406 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187302572] [2021-10-11 02:28:53,407 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:53,407 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:53,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:53,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:53,410 INFO L87 Difference]: Start difference. First operand 299 states and 440 transitions. Second operand 4 states. [2021-10-11 02:28:53,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:53,525 INFO L93 Difference]: Finished difference Result 962 states and 1420 transitions. [2021-10-11 02:28:53,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:28:53,526 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2021-10-11 02:28:53,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:53,530 INFO L225 Difference]: With dead ends: 962 [2021-10-11 02:28:53,530 INFO L226 Difference]: Without dead ends: 669 [2021-10-11 02:28:53,531 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 02:28:53,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2021-10-11 02:28:53,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 565. [2021-10-11 02:28:53,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2021-10-11 02:28:53,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 826 transitions. [2021-10-11 02:28:53,572 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 826 transitions. Word has length 25 [2021-10-11 02:28:53,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:53,573 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 826 transitions. [2021-10-11 02:28:53,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:53,573 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 826 transitions. [2021-10-11 02:28:53,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:28:53,576 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:53,577 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:28:53,577 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:28:53,577 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:53,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:53,578 INFO L82 PathProgramCache]: Analyzing trace with hash 527643662, now seen corresponding path program 1 times [2021-10-11 02:28:53,578 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:53,578 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758226486] [2021-10-11 02:28:53,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:53,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:53,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:28:53,669 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758226486] [2021-10-11 02:28:53,670 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:53,670 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-11 02:28:53,671 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587391109] [2021-10-11 02:28:53,671 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:53,671 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:53,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:53,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:53,673 INFO L87 Difference]: Start difference. First operand 565 states and 826 transitions. Second operand 4 states. [2021-10-11 02:28:53,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:53,835 INFO L93 Difference]: Finished difference Result 1426 states and 2088 transitions. [2021-10-11 02:28:53,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:28:53,838 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2021-10-11 02:28:53,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:53,844 INFO L225 Difference]: With dead ends: 1426 [2021-10-11 02:28:53,844 INFO L226 Difference]: Without dead ends: 869 [2021-10-11 02:28:53,846 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-11 02:28:53,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2021-10-11 02:28:53,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 707. [2021-10-11 02:28:53,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2021-10-11 02:28:53,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 1039 transitions. [2021-10-11 02:28:53,896 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 1039 transitions. Word has length 27 [2021-10-11 02:28:53,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:53,906 INFO L481 AbstractCegarLoop]: Abstraction has 707 states and 1039 transitions. [2021-10-11 02:28:53,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:53,907 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 1039 transitions. [2021-10-11 02:28:53,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:28:53,908 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:53,908 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:28:53,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:28:53,908 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:53,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:53,909 INFO L82 PathProgramCache]: Analyzing trace with hash -856243533, now seen corresponding path program 1 times [2021-10-11 02:28:53,909 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:53,909 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086643345] [2021-10-11 02:28:53,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:53,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:54,024 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-11 02:28:54,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086643345] [2021-10-11 02:28:54,025 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:54,025 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:28:54,025 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089943719] [2021-10-11 02:28:54,026 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:28:54,026 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:54,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:28:54,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:28:54,027 INFO L87 Difference]: Start difference. First operand 707 states and 1039 transitions. Second operand 6 states. [2021-10-11 02:28:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:54,260 INFO L93 Difference]: Finished difference Result 2463 states and 3643 transitions. [2021-10-11 02:28:54,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:28:54,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2021-10-11 02:28:54,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:54,273 INFO L225 Difference]: With dead ends: 2463 [2021-10-11 02:28:54,274 INFO L226 Difference]: Without dead ends: 1764 [2021-10-11 02:28:54,276 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:28:54,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1764 states. [2021-10-11 02:28:54,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1764 to 970. [2021-10-11 02:28:54,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2021-10-11 02:28:54,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1429 transitions. [2021-10-11 02:28:54,359 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1429 transitions. Word has length 27 [2021-10-11 02:28:54,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:54,361 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1429 transitions. [2021-10-11 02:28:54,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:28:54,361 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1429 transitions. [2021-10-11 02:28:54,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 02:28:54,365 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:54,366 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 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-11 02:28:54,366 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:28:54,366 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:54,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:54,367 INFO L82 PathProgramCache]: Analyzing trace with hash 662696689, now seen corresponding path program 1 times [2021-10-11 02:28:54,367 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:54,368 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982432623] [2021-10-11 02:28:54,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:54,422 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:28:54,422 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982432623] [2021-10-11 02:28:54,423 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:54,423 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:54,423 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032537281] [2021-10-11 02:28:54,423 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:28:54,423 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:54,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:28:54,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:28:54,424 INFO L87 Difference]: Start difference. First operand 970 states and 1429 transitions. Second operand 3 states. [2021-10-11 02:28:54,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:54,503 INFO L93 Difference]: Finished difference Result 1709 states and 2526 transitions. [2021-10-11 02:28:54,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:28:54,504 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2021-10-11 02:28:54,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:54,510 INFO L225 Difference]: With dead ends: 1709 [2021-10-11 02:28:54,510 INFO L226 Difference]: Without dead ends: 994 [2021-10-11 02:28:54,512 INFO L677 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-11 02:28:54,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-10-11 02:28:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2021-10-11 02:28:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2021-10-11 02:28:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1403 transitions. [2021-10-11 02:28:54,595 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1403 transitions. Word has length 39 [2021-10-11 02:28:54,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:54,596 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1403 transitions. [2021-10-11 02:28:54,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:28:54,596 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1403 transitions. [2021-10-11 02:28:54,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2021-10-11 02:28:54,598 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:54,598 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 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-11 02:28:54,598 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:28:54,598 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:54,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:54,599 INFO L82 PathProgramCache]: Analyzing trace with hash -328467984, now seen corresponding path program 1 times [2021-10-11 02:28:54,599 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:54,599 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639882459] [2021-10-11 02:28:54,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:54,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:54,652 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:54,652 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639882459] [2021-10-11 02:28:54,656 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:54,657 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:54,658 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238221529] [2021-10-11 02:28:54,658 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:54,659 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:54,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:54,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:54,660 INFO L87 Difference]: Start difference. First operand 970 states and 1403 transitions. Second operand 4 states. [2021-10-11 02:28:54,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:54,775 INFO L93 Difference]: Finished difference Result 1991 states and 2875 transitions. [2021-10-11 02:28:54,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:28:54,776 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 39 [2021-10-11 02:28:54,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:54,784 INFO L225 Difference]: With dead ends: 1991 [2021-10-11 02:28:54,784 INFO L226 Difference]: Without dead ends: 1276 [2021-10-11 02:28:54,786 INFO L677 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-11 02:28:54,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2021-10-11 02:28:54,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 970. [2021-10-11 02:28:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2021-10-11 02:28:54,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1390 transitions. [2021-10-11 02:28:54,866 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1390 transitions. Word has length 39 [2021-10-11 02:28:54,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:54,867 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1390 transitions. [2021-10-11 02:28:54,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:54,869 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1390 transitions. [2021-10-11 02:28:54,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 02:28:54,871 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:54,871 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 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-11 02:28:54,872 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:28:54,872 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:54,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:54,872 INFO L82 PathProgramCache]: Analyzing trace with hash -623442532, now seen corresponding path program 1 times [2021-10-11 02:28:54,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:54,873 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100640797] [2021-10-11 02:28:54,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:54,950 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100640797] [2021-10-11 02:28:54,950 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:54,950 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:54,950 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492619828] [2021-10-11 02:28:54,952 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:54,952 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:54,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:54,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:54,953 INFO L87 Difference]: Start difference. First operand 970 states and 1390 transitions. Second operand 4 states. [2021-10-11 02:28:55,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:55,055 INFO L93 Difference]: Finished difference Result 1956 states and 2802 transitions. [2021-10-11 02:28:55,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:28:55,055 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2021-10-11 02:28:55,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:55,061 INFO L225 Difference]: With dead ends: 1956 [2021-10-11 02:28:55,062 INFO L226 Difference]: Without dead ends: 994 [2021-10-11 02:28:55,063 INFO L677 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-11 02:28:55,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2021-10-11 02:28:55,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 970. [2021-10-11 02:28:55,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 970 states. [2021-10-11 02:28:55,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1382 transitions. [2021-10-11 02:28:55,130 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1382 transitions. Word has length 40 [2021-10-11 02:28:55,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:55,132 INFO L481 AbstractCegarLoop]: Abstraction has 970 states and 1382 transitions. [2021-10-11 02:28:55,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:55,133 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1382 transitions. [2021-10-11 02:28:55,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-10-11 02:28:55,134 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:55,134 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 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-11 02:28:55,135 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:28:55,135 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:55,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:55,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1737284084, now seen corresponding path program 1 times [2021-10-11 02:28:55,136 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:55,136 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140218961] [2021-10-11 02:28:55,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:55,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:55,219 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:55,220 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140218961] [2021-10-11 02:28:55,220 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:55,220 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:28:55,221 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132558200] [2021-10-11 02:28:55,221 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:28:55,221 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:55,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:28:55,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:28:55,223 INFO L87 Difference]: Start difference. First operand 970 states and 1382 transitions. Second operand 5 states. [2021-10-11 02:28:55,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:55,505 INFO L93 Difference]: Finished difference Result 2699 states and 3741 transitions. [2021-10-11 02:28:55,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:28:55,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2021-10-11 02:28:55,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:55,515 INFO L225 Difference]: With dead ends: 2699 [2021-10-11 02:28:55,515 INFO L226 Difference]: Without dead ends: 1737 [2021-10-11 02:28:55,520 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:28:55,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2021-10-11 02:28:55,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1297. [2021-10-11 02:28:55,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1297 states. [2021-10-11 02:28:55,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1297 states to 1297 states and 1767 transitions. [2021-10-11 02:28:55,644 INFO L78 Accepts]: Start accepts. Automaton has 1297 states and 1767 transitions. Word has length 40 [2021-10-11 02:28:55,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:55,645 INFO L481 AbstractCegarLoop]: Abstraction has 1297 states and 1767 transitions. [2021-10-11 02:28:55,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:28:55,645 INFO L276 IsEmpty]: Start isEmpty. Operand 1297 states and 1767 transitions. [2021-10-11 02:28:55,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-10-11 02:28:55,646 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:55,646 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 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-11 02:28:55,646 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-11 02:28:55,647 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:55,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:55,647 INFO L82 PathProgramCache]: Analyzing trace with hash -1532982504, now seen corresponding path program 1 times [2021-10-11 02:28:55,647 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:55,648 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574812280] [2021-10-11 02:28:55,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:55,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:55,718 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:55,718 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574812280] [2021-10-11 02:28:55,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:55,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:28:55,719 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254372645] [2021-10-11 02:28:55,719 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:28:55,719 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:55,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:28:55,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:28:55,720 INFO L87 Difference]: Start difference. First operand 1297 states and 1767 transitions. Second operand 5 states. [2021-10-11 02:28:56,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:56,019 INFO L93 Difference]: Finished difference Result 3326 states and 4432 transitions. [2021-10-11 02:28:56,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:28:56,020 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2021-10-11 02:28:56,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:56,031 INFO L225 Difference]: With dead ends: 3326 [2021-10-11 02:28:56,031 INFO L226 Difference]: Without dead ends: 1869 [2021-10-11 02:28:56,033 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:28:56,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1869 states. [2021-10-11 02:28:56,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1869 to 1203. [2021-10-11 02:28:56,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1203 states. [2021-10-11 02:28:56,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1570 transitions. [2021-10-11 02:28:56,127 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1570 transitions. Word has length 42 [2021-10-11 02:28:56,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:56,127 INFO L481 AbstractCegarLoop]: Abstraction has 1203 states and 1570 transitions. [2021-10-11 02:28:56,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:28:56,127 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1570 transitions. [2021-10-11 02:28:56,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-10-11 02:28:56,128 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:56,129 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:56,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-10-11 02:28:56,129 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:56,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:56,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2020617940, now seen corresponding path program 1 times [2021-10-11 02:28:56,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:56,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509368838] [2021-10-11 02:28:56,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:56,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:56,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509368838] [2021-10-11 02:28:56,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:56,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:56,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947675076] [2021-10-11 02:28:56,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:28:56,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:56,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:28:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:56,233 INFO L87 Difference]: Start difference. First operand 1203 states and 1570 transitions. Second operand 4 states. [2021-10-11 02:28:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:56,417 INFO L93 Difference]: Finished difference Result 2809 states and 3689 transitions. [2021-10-11 02:28:56,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:28:56,417 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 47 [2021-10-11 02:28:56,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:56,427 INFO L225 Difference]: With dead ends: 2809 [2021-10-11 02:28:56,427 INFO L226 Difference]: Without dead ends: 1758 [2021-10-11 02:28:56,434 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:28:56,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1758 states. [2021-10-11 02:28:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1758 to 1517. [2021-10-11 02:28:56,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1517 states. [2021-10-11 02:28:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1517 states to 1517 states and 1975 transitions. [2021-10-11 02:28:56,565 INFO L78 Accepts]: Start accepts. Automaton has 1517 states and 1975 transitions. Word has length 47 [2021-10-11 02:28:56,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:56,565 INFO L481 AbstractCegarLoop]: Abstraction has 1517 states and 1975 transitions. [2021-10-11 02:28:56,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:28:56,565 INFO L276 IsEmpty]: Start isEmpty. Operand 1517 states and 1975 transitions. [2021-10-11 02:28:56,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-10-11 02:28:56,567 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:56,567 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:56,567 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-10-11 02:28:56,567 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:56,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:56,568 INFO L82 PathProgramCache]: Analyzing trace with hash -879860173, now seen corresponding path program 1 times [2021-10-11 02:28:56,568 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:56,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621338863] [2021-10-11 02:28:56,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:28:56,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621338863] [2021-10-11 02:28:56,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:56,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-10-11 02:28:56,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652972974] [2021-10-11 02:28:56,643 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-10-11 02:28:56,643 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-10-11 02:28:56,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-10-11 02:28:56,644 INFO L87 Difference]: Start difference. First operand 1517 states and 1975 transitions. Second operand 6 states. [2021-10-11 02:28:56,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:56,959 INFO L93 Difference]: Finished difference Result 2834 states and 3695 transitions. [2021-10-11 02:28:56,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:28:56,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 48 [2021-10-11 02:28:56,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:56,967 INFO L225 Difference]: With dead ends: 2834 [2021-10-11 02:28:56,967 INFO L226 Difference]: Without dead ends: 1493 [2021-10-11 02:28:56,970 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2021-10-11 02:28:56,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1493 states. [2021-10-11 02:28:57,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1493 to 1293. [2021-10-11 02:28:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1293 states. [2021-10-11 02:28:57,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1293 states to 1293 states and 1693 transitions. [2021-10-11 02:28:57,090 INFO L78 Accepts]: Start accepts. Automaton has 1293 states and 1693 transitions. Word has length 48 [2021-10-11 02:28:57,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:57,092 INFO L481 AbstractCegarLoop]: Abstraction has 1293 states and 1693 transitions. [2021-10-11 02:28:57,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2021-10-11 02:28:57,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1293 states and 1693 transitions. [2021-10-11 02:28:57,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2021-10-11 02:28:57,093 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:57,094 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:57,094 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-10-11 02:28:57,094 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:57,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:57,095 INFO L82 PathProgramCache]: Analyzing trace with hash 146353322, now seen corresponding path program 1 times [2021-10-11 02:28:57,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:57,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323110600] [2021-10-11 02:28:57,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:57,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:57,125 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:57,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323110600] [2021-10-11 02:28:57,125 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:57,125 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:28:57,126 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617954034] [2021-10-11 02:28:57,126 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:28:57,126 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:57,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:28:57,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:28:57,127 INFO L87 Difference]: Start difference. First operand 1293 states and 1693 transitions. Second operand 3 states. [2021-10-11 02:28:57,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:57,227 INFO L93 Difference]: Finished difference Result 1385 states and 1800 transitions. [2021-10-11 02:28:57,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:28:57,227 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2021-10-11 02:28:57,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:57,235 INFO L225 Difference]: With dead ends: 1385 [2021-10-11 02:28:57,235 INFO L226 Difference]: Without dead ends: 1302 [2021-10-11 02:28:57,236 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 02:28:57,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1302 states. [2021-10-11 02:28:57,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1302 to 1295. [2021-10-11 02:28:57,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1295 states. [2021-10-11 02:28:57,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 1695 transitions. [2021-10-11 02:28:57,327 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 1695 transitions. Word has length 50 [2021-10-11 02:28:57,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:57,327 INFO L481 AbstractCegarLoop]: Abstraction has 1295 states and 1695 transitions. [2021-10-11 02:28:57,327 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:28:57,327 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 1695 transitions. [2021-10-11 02:28:57,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-11 02:28:57,329 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:57,329 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:57,329 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-10-11 02:28:57,330 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:57,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:57,330 INFO L82 PathProgramCache]: Analyzing trace with hash -316949578, now seen corresponding path program 1 times [2021-10-11 02:28:57,330 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:57,330 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394151057] [2021-10-11 02:28:57,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:57,363 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:57,363 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394151057] [2021-10-11 02:28:57,363 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:57,364 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:28:57,364 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976966212] [2021-10-11 02:28:57,364 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:28:57,364 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:57,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:28:57,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:28:57,365 INFO L87 Difference]: Start difference. First operand 1295 states and 1695 transitions. Second operand 3 states. [2021-10-11 02:28:57,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:57,462 INFO L93 Difference]: Finished difference Result 2678 states and 3500 transitions. [2021-10-11 02:28:57,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:28:57,463 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-10-11 02:28:57,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:57,471 INFO L225 Difference]: With dead ends: 2678 [2021-10-11 02:28:57,471 INFO L226 Difference]: Without dead ends: 1428 [2021-10-11 02:28:57,473 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-11 02:28:57,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1428 states. [2021-10-11 02:28:57,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1428 to 1428. [2021-10-11 02:28:57,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1428 states. [2021-10-11 02:28:57,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1428 states to 1428 states and 1852 transitions. [2021-10-11 02:28:57,586 INFO L78 Accepts]: Start accepts. Automaton has 1428 states and 1852 transitions. Word has length 56 [2021-10-11 02:28:57,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:57,586 INFO L481 AbstractCegarLoop]: Abstraction has 1428 states and 1852 transitions. [2021-10-11 02:28:57,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:28:57,587 INFO L276 IsEmpty]: Start isEmpty. Operand 1428 states and 1852 transitions. [2021-10-11 02:28:57,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-11 02:28:57,588 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:57,588 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:57,589 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-10-11 02:28:57,589 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:57,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:57,589 INFO L82 PathProgramCache]: Analyzing trace with hash -430336235, now seen corresponding path program 1 times [2021-10-11 02:28:57,589 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:57,590 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795079992] [2021-10-11 02:28:57,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:57,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:57,645 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:28:57,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795079992] [2021-10-11 02:28:57,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:57,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:57,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60461855] [2021-10-11 02:28:57,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:28:57,646 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:57,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:28:57,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:28:57,647 INFO L87 Difference]: Start difference. First operand 1428 states and 1852 transitions. Second operand 3 states. [2021-10-11 02:28:57,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:57,781 INFO L93 Difference]: Finished difference Result 2823 states and 3670 transitions. [2021-10-11 02:28:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:28:57,782 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-10-11 02:28:57,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:57,790 INFO L225 Difference]: With dead ends: 2823 [2021-10-11 02:28:57,790 INFO L226 Difference]: Without dead ends: 1516 [2021-10-11 02:28:57,792 INFO L677 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-11 02:28:57,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1516 states. [2021-10-11 02:28:57,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1516 to 1507. [2021-10-11 02:28:57,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2021-10-11 02:28:57,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1880 transitions. [2021-10-11 02:28:57,919 INFO L78 Accepts]: Start accepts. Automaton has 1507 states and 1880 transitions. Word has length 56 [2021-10-11 02:28:57,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:57,919 INFO L481 AbstractCegarLoop]: Abstraction has 1507 states and 1880 transitions. [2021-10-11 02:28:57,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:28:57,919 INFO L276 IsEmpty]: Start isEmpty. Operand 1507 states and 1880 transitions. [2021-10-11 02:28:57,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2021-10-11 02:28:57,921 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:57,921 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:57,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-10-11 02:28:57,921 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:57,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:57,922 INFO L82 PathProgramCache]: Analyzing trace with hash -1965626567, now seen corresponding path program 1 times [2021-10-11 02:28:57,922 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:57,922 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501355532] [2021-10-11 02:28:57,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:57,955 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:57,956 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501355532] [2021-10-11 02:28:57,956 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:57,956 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:28:57,956 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699630078] [2021-10-11 02:28:57,958 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:28:57,958 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:57,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:28:57,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:28:57,959 INFO L87 Difference]: Start difference. First operand 1507 states and 1880 transitions. Second operand 3 states. [2021-10-11 02:28:58,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:58,048 INFO L93 Difference]: Finished difference Result 2374 states and 2982 transitions. [2021-10-11 02:28:58,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:28:58,048 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2021-10-11 02:28:58,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:58,054 INFO L225 Difference]: With dead ends: 2374 [2021-10-11 02:28:58,054 INFO L226 Difference]: Without dead ends: 1006 [2021-10-11 02:28:58,057 INFO L677 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-11 02:28:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2021-10-11 02:28:58,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 905. [2021-10-11 02:28:58,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 905 states. [2021-10-11 02:28:58,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 905 states to 905 states and 1116 transitions. [2021-10-11 02:28:58,122 INFO L78 Accepts]: Start accepts. Automaton has 905 states and 1116 transitions. Word has length 56 [2021-10-11 02:28:58,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:58,122 INFO L481 AbstractCegarLoop]: Abstraction has 905 states and 1116 transitions. [2021-10-11 02:28:58,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:28:58,122 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1116 transitions. [2021-10-11 02:28:58,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2021-10-11 02:28:58,123 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:58,123 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:58,123 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-10-11 02:28:58,124 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:58,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:58,124 INFO L82 PathProgramCache]: Analyzing trace with hash 1864326967, now seen corresponding path program 1 times [2021-10-11 02:28:58,124 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:58,124 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713204782] [2021-10-11 02:28:58,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:58,203 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-10-11 02:28:58,203 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713204782] [2021-10-11 02:28:58,203 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:28:58,204 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-11 02:28:58,204 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985768511] [2021-10-11 02:28:58,207 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:28:58,207 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:28:58,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:28:58,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:28:58,208 INFO L87 Difference]: Start difference. First operand 905 states and 1116 transitions. Second operand 5 states. [2021-10-11 02:28:58,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:28:58,442 INFO L93 Difference]: Finished difference Result 2463 states and 3062 transitions. [2021-10-11 02:28:58,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-11 02:28:58,442 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 57 [2021-10-11 02:28:58,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:28:58,451 INFO L225 Difference]: With dead ends: 2463 [2021-10-11 02:28:58,451 INFO L226 Difference]: Without dead ends: 1683 [2021-10-11 02:28:58,453 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-10-11 02:28:58,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1683 states. [2021-10-11 02:28:58,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1683 to 1060. [2021-10-11 02:28:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1060 states. [2021-10-11 02:28:58,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1060 states to 1060 states and 1305 transitions. [2021-10-11 02:28:58,533 INFO L78 Accepts]: Start accepts. Automaton has 1060 states and 1305 transitions. Word has length 57 [2021-10-11 02:28:58,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:28:58,534 INFO L481 AbstractCegarLoop]: Abstraction has 1060 states and 1305 transitions. [2021-10-11 02:28:58,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:28:58,534 INFO L276 IsEmpty]: Start isEmpty. Operand 1060 states and 1305 transitions. [2021-10-11 02:28:58,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2021-10-11 02:28:58,541 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:28:58,541 INFO L422 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 02:28:58,541 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-10-11 02:28:58,541 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:28:58,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:28:58,542 INFO L82 PathProgramCache]: Analyzing trace with hash -1500251139, now seen corresponding path program 1 times [2021-10-11 02:28:58,542 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:28:58,542 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299612328] [2021-10-11 02:28:58,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:28:58,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:58,616 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:28:58,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299612328] [2021-10-11 02:28:58,616 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [569244762] [2021-10-11 02:28:58,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:28:58,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:28:58,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 9 conjunts are in the unsatisfiable core [2021-10-11 02:28:58,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:28:58,913 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:28:58,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:28:59,026 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-10-11 02:28:59,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1278097192] [2021-10-11 02:28:59,053 INFO L159 IcfgInterpreter]: Started Sifa with 45 locations of interest [2021-10-11 02:28:59,053 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:28:59,058 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:28:59,064 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:28:59,065 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:29:00,105 WARN L197 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 236 DAG size of output: 236 [2021-10-11 02:29:00,635 WARN L197 SmtUtils]: Spent 168.00 ms on a formula simplification. DAG size of input: 235 DAG size of output: 235 [2021-10-11 02:29:01,094 WARN L197 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 238 DAG size of output: 238 [2021-10-11 02:29:01,122 FATAL L? ?]: Ignoring exception! java.util.ConcurrentModificationException at java.base/java.util.HashMap.computeIfAbsent(HashMap.java:1134) at de.uni_freiburg.informatik.ultimate.lib.sifa.summarizers.FixpointLoopSummarizer.summarize(FixpointLoopSummarizer.java:94) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretLoop(DagInterpreter.java:177) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.ipretNode(DagInterpreter.java:168) at de.uni_freiburg.informatik.ultimate.lib.sifa.DagInterpreter.interpret(DagInterpreter.java:123) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpretLoisInProcedure(IcfgInterpreter.java:136) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.interpret(IcfgInterpreter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:67) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:289) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:84) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:74) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:511) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:438) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:372) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResult.iterate(CegarLoopResult.java:138) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterateNew(TraceAbstractionStarter.java:345) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:198) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-10-11 02:29:01,123 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:29:01,124 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2021-10-11 02:29:01,125 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869174143] [2021-10-11 02:29:01,125 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:29:01,125 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:29:01,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:29:01,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:29:01,126 INFO L87 Difference]: Start difference. First operand 1060 states and 1305 transitions. Second operand 5 states. [2021-10-11 02:29:01,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:29:01,326 INFO L93 Difference]: Finished difference Result 2339 states and 2894 transitions. [2021-10-11 02:29:01,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-11 02:29:01,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 58 [2021-10-11 02:29:01,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:29:01,336 INFO L225 Difference]: With dead ends: 2339 [2021-10-11 02:29:01,336 INFO L226 Difference]: Without dead ends: 1728 [2021-10-11 02:29:01,338 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-10-11 02:29:01,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1728 states. [2021-10-11 02:29:01,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1728 to 1125. [2021-10-11 02:29:01,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1125 states. [2021-10-11 02:29:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1379 transitions. [2021-10-11 02:29:01,452 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1379 transitions. Word has length 58 [2021-10-11 02:29:01,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:29:01,453 INFO L481 AbstractCegarLoop]: Abstraction has 1125 states and 1379 transitions. [2021-10-11 02:29:01,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:29:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1379 transitions. [2021-10-11 02:29:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-10-11 02:29:01,455 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:29:01,455 INFO L422 BasicCegarLoop]: trace histogram [6, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:29:01,670 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable19 [2021-10-11 02:29:01,671 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:29:01,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:29:01,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1654378543, now seen corresponding path program 1 times [2021-10-11 02:29:01,671 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:29:01,671 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391560148] [2021-10-11 02:29:01,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:29:01,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:29:01,699 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:29:01,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:29:01,730 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:29:01,782 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:29:01,782 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:29:01,783 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2021-10-11 02:29:01,931 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:29:01 BoogieIcfgContainer [2021-10-11 02:29:01,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:29:01,932 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:29:01,932 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:29:01,937 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:29:01,938 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:28:51" (3/4) ... [2021-10-11 02:29:01,940 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:29:02,101 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_58859fb6-6e45-43ed-8de7-0e86e3fd735b/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:29:02,101 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:29:02,102 INFO L168 Benchmark]: Toolchain (without parser) took 12269.25 ms. Allocated memory was 94.4 MB in the beginning and 360.7 MB in the end (delta: 266.3 MB). Free memory was 52.5 MB in the beginning and 257.2 MB in the end (delta: -204.7 MB). Peak memory consumption was 61.9 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,103 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 94.4 MB. Free memory is still 68.7 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:29:02,103 INFO L168 Benchmark]: CACSL2BoogieTranslator took 547.79 ms. Allocated memory is still 94.4 MB. Free memory was 52.3 MB in the beginning and 66.1 MB in the end (delta: -13.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,104 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.87 ms. Allocated memory is still 94.4 MB. Free memory was 66.1 MB in the beginning and 63.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,104 INFO L168 Benchmark]: Boogie Preprocessor took 54.15 ms. Allocated memory is still 94.4 MB. Free memory was 63.8 MB in the beginning and 61.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,105 INFO L168 Benchmark]: RCFGBuilder took 1469.12 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 61.7 MB in the beginning and 48.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,108 INFO L168 Benchmark]: TraceAbstraction took 9940.10 ms. Allocated memory was 113.2 MB in the beginning and 360.7 MB in the end (delta: 247.5 MB). Free memory was 47.4 MB in the beginning and 274.0 MB in the end (delta: -226.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,109 INFO L168 Benchmark]: Witness Printer took 169.16 ms. Allocated memory is still 360.7 MB. Free memory was 274.0 MB in the beginning and 257.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:29:02,111 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.27 ms. Allocated memory is still 94.4 MB. Free memory is still 68.7 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 547.79 ms. Allocated memory is still 94.4 MB. Free memory was 52.3 MB in the beginning and 66.1 MB in the end (delta: -13.8 MB). Peak memory consumption was 6.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.87 ms. Allocated memory is still 94.4 MB. Free memory was 66.1 MB in the beginning and 63.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 54.15 ms. Allocated memory is still 94.4 MB. Free memory was 63.8 MB in the beginning and 61.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1469.12 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 61.7 MB in the beginning and 48.1 MB in the end (delta: 13.6 MB). Peak memory consumption was 41.4 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9940.10 ms. Allocated memory was 113.2 MB in the beginning and 360.7 MB in the end (delta: 247.5 MB). Free memory was 47.4 MB in the beginning and 274.0 MB in the end (delta: -226.5 MB). Peak memory consumption was 20.5 MB. Max. memory is 16.1 GB. * Witness Printer took 169.16 ms. Allocated memory is still 360.7 MB. Free memory was 274.0 MB in the beginning and 257.2 MB in the end (delta: 16.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L109] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L191] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L437] COND TRUE 1 [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp___1) [L302] C_1_st = 1 [L130] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L133] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L148] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L150] COND TRUE num == 0 [L151] timer = 1 [L152] i += 1 [L153] C_1_pc = 1 [L154] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 [L74] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop [L51] COND TRUE i___0 == 0 [L52] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND FALSE !((int )P_1_st == 0) [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 [L448] kernel_st = 3 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; [L246] COND FALSE !((int )P_1_st == 0) [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 [L260] return (__retres1); [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 [L419] return (__retres2); [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 [L74] COND FALSE !((int )P_1_pc == 0) [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND FALSE !((int )P_1_st == 0) [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 [L448] kernel_st = 3 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) [L188] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) [L243] int __retres1 ; [L246] COND FALSE !((int )P_1_st == 0) [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 [L260] return (__retres1); [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 [L419] return (__retres2); [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 [L243] int __retres1 ; [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 [L260] return (__retres1); [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 [L74] COND FALSE !((int )P_1_pc == 0) [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L11] reach_error() VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 64 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 9.7s, OverallIterations: 21, TraceHistogramMax: 6, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2239 SDtfs, 2976 SDslu, 3098 SDs, 0 SdLazy, 711 SolverSat, 142 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 228 GetRequests, 159 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1517occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 20 MinimizatonAttempts, 4534 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 929 NumberOfCodeBlocks, 929 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 874 ConstructedInterpolants, 0 QuantifiedInterpolants, 93667 SizeOfPredicates, 2 NumberOfNonLiveVariables, 289 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 22 InterpolantComputations, 19 PerfectInterpolantSequences, 173/221 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...