./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 47ea0209 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8 --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 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f --- Real Ultimate output --- This is Ultimate 0.2.1-dev-47ea020 [2021-11-07 00:58:23,179 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-07 00:58:23,183 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-07 00:58:23,241 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-07 00:58:23,241 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-07 00:58:23,243 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-07 00:58:23,246 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-07 00:58:23,249 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-07 00:58:23,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-07 00:58:23,265 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-07 00:58:23,267 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-07 00:58:23,270 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-07 00:58:23,272 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-07 00:58:23,275 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-07 00:58:23,278 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-07 00:58:23,281 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-07 00:58:23,284 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-07 00:58:23,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-07 00:58:23,293 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-07 00:58:23,302 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-07 00:58:23,305 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-07 00:58:23,307 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-07 00:58:23,311 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-07 00:58:23,313 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-07 00:58:23,322 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-07 00:58:23,323 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-07 00:58:23,323 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-07 00:58:23,326 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-07 00:58:23,327 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-07 00:58:23,329 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-07 00:58:23,330 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-07 00:58:23,331 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-07 00:58:23,334 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-07 00:58:23,336 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-07 00:58:23,338 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-07 00:58:23,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-07 00:58:23,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-07 00:58:23,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-07 00:58:23,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-07 00:58:23,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-07 00:58:23,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-07 00:58:23,344 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-07 00:58:23,410 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-07 00:58:23,411 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-07 00:58:23,413 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-07 00:58:23,414 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-07 00:58:23,414 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-07 00:58:23,414 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-07 00:58:23,415 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-07 00:58:23,415 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-07 00:58:23,415 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-07 00:58:23,415 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-07 00:58:23,421 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-07 00:58:23,422 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-07 00:58:23,422 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-07 00:58:23,423 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-07 00:58:23,423 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-07 00:58:23,424 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-07 00:58:23,425 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-07 00:58:23,425 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-07 00:58:23,425 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-07 00:58:23,426 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-07 00:58:23,426 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-07 00:58:23,426 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-07 00:58:23,426 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-07 00:58:23,427 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-07 00:58:23,427 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-07 00:58:23,427 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-07 00:58:23,428 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-07 00:58:23,428 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-07 00:58:23,428 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-07 00:58:23,429 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-07 00:58:23,429 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:58:23,430 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-07 00:58:23,430 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-07 00:58:23,431 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-07 00:58:23,431 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-07 00:58:23,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-07 00:58:23,432 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-07 00:58:23,432 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-07 00:58:23,433 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-07 00:58:23,433 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_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/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_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8 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 -> 327bb4ad7f981d20a6e5212aac300a9249d1857b0280531d57d587d5a0195c5f [2021-11-07 00:58:23,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-07 00:58:23,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-07 00:58:23,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-07 00:58:23,827 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-07 00:58:23,828 INFO L275 PluginConnector]: CDTParser initialized [2021-11-07 00:58:23,830 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/../../sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-11-07 00:58:23,910 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/data/9c2741fec/838f7e818e464beeac1e15dd82095c8b/FLAG14426afd1 [2021-11-07 00:58:24,440 INFO L306 CDTParser]: Found 1 translation units. [2021-11-07 00:58:24,441 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/sv-benchmarks/c/systemc/token_ring.01.cil-2.c [2021-11-07 00:58:24,451 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/data/9c2741fec/838f7e818e464beeac1e15dd82095c8b/FLAG14426afd1 [2021-11-07 00:58:24,785 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/data/9c2741fec/838f7e818e464beeac1e15dd82095c8b [2021-11-07 00:58:24,788 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-07 00:58:24,790 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-07 00:58:24,808 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-07 00:58:24,808 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-07 00:58:24,811 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-07 00:58:24,812 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:58:24" (1/1) ... [2021-11-07 00:58:24,814 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29309748 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:24, skipping insertion in model container [2021-11-07 00:58:24,814 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 12:58:24" (1/1) ... [2021-11-07 00:58:24,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-07 00:58:24,854 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-07 00:58:25,059 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-11-07 00:58:25,145 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:58:25,156 INFO L203 MainTranslator]: Completed pre-run [2021-11-07 00:58:25,167 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/sv-benchmarks/c/systemc/token_ring.01.cil-2.c[671,684] [2021-11-07 00:58:25,194 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-07 00:58:25,211 INFO L208 MainTranslator]: Completed translation [2021-11-07 00:58:25,212 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25 WrapperNode [2021-11-07 00:58:25,212 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-07 00:58:25,213 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-07 00:58:25,213 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-07 00:58:25,213 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-07 00:58:25,223 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,250 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,300 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-07 00:58:25,303 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-07 00:58:25,303 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-07 00:58:25,304 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-07 00:58:25,315 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,315 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,329 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,330 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,376 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,383 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,395 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-07 00:58:25,399 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-07 00:58:25,400 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-07 00:58:25,400 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-07 00:58:25,401 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (1/1) ... [2021-11-07 00:58:25,410 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-07 00:58:25,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:25,436 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-07 00:58:25,451 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-07 00:58:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-07 00:58:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-07 00:58:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-07 00:58:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-07 00:58:26,888 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-07 00:58:26,889 INFO L299 CfgBuilder]: Removed 82 assume(true) statements. [2021-11-07 00:58:26,892 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:26 BoogieIcfgContainer [2021-11-07 00:58:26,892 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-07 00:58:26,912 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-07 00:58:26,913 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-07 00:58:26,916 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-07 00:58:26,916 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 12:58:24" (1/3) ... [2021-11-07 00:58:26,917 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18423032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:26, skipping insertion in model container [2021-11-07 00:58:26,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 12:58:25" (2/3) ... [2021-11-07 00:58:26,918 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18423032 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 12:58:26, skipping insertion in model container [2021-11-07 00:58:26,918 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:26" (3/3) ... [2021-11-07 00:58:26,922 INFO L111 eAbstractionObserver]: Analyzing ICFG token_ring.01.cil-2.c [2021-11-07 00:58:26,932 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-07 00:58:26,932 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-11-07 00:58:26,998 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-07 00:58:27,009 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-07 00:58:27,009 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2021-11-07 00:58:27,035 INFO L276 IsEmpty]: Start isEmpty. Operand has 68 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 67 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 00:58:27,044 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:27,044 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:27,045 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:27,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:27,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1927853534, now seen corresponding path program 1 times [2021-11-07 00:58:27,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:27,064 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589653117] [2021-11-07 00:58:27,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:27,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:27,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:27,292 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:27,293 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:27,293 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589653117] [2021-11-07 00:58:27,295 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589653117] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:27,295 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:27,296 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 00:58:27,298 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742088115] [2021-11-07 00:58:27,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:58:27,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:27,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:58:27,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:27,330 INFO L87 Difference]: Start difference. First operand has 68 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 67 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:27,453 INFO L93 Difference]: Finished difference Result 176 states and 271 transitions. [2021-11-07 00:58:27,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:58:27,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 00:58:27,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:27,472 INFO L225 Difference]: With dead ends: 176 [2021-11-07 00:58:27,472 INFO L226 Difference]: Without dead ends: 110 [2021-11-07 00:58:27,478 INFO L786 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-11-07 00:58:27,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-11-07 00:58:27,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2021-11-07 00:58:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 103 states have (on average 1.4854368932038835) internal successors, (153), 104 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 153 transitions. [2021-11-07 00:58:27,561 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 153 transitions. Word has length 16 [2021-11-07 00:58:27,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:27,561 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 153 transitions. [2021-11-07 00:58:27,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,562 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 153 transitions. [2021-11-07 00:58:27,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-11-07 00:58:27,564 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:27,565 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:27,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-07 00:58:27,565 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:27,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:27,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1078919233, now seen corresponding path program 1 times [2021-11-07 00:58:27,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:27,570 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412306365] [2021-11-07 00:58:27,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:27,571 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:27,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:27,708 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:27,708 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412306365] [2021-11-07 00:58:27,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412306365] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:27,709 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:27,710 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-07 00:58:27,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328842144] [2021-11-07 00:58:27,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:58:27,712 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:27,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:58:27,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:27,715 INFO L87 Difference]: Start difference. First operand 105 states and 153 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:27,794 INFO L93 Difference]: Finished difference Result 283 states and 408 transitions. [2021-11-07 00:58:27,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:58:27,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-11-07 00:58:27,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:27,800 INFO L225 Difference]: With dead ends: 283 [2021-11-07 00:58:27,802 INFO L226 Difference]: Without dead ends: 180 [2021-11-07 00:58:27,804 INFO L786 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-11-07 00:58:27,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2021-11-07 00:58:27,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 169. [2021-11-07 00:58:27,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 167 states have (on average 1.407185628742515) internal successors, (235), 168 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 235 transitions. [2021-11-07 00:58:27,832 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 235 transitions. Word has length 16 [2021-11-07 00:58:27,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:27,833 INFO L470 AbstractCegarLoop]: Abstraction has 169 states and 235 transitions. [2021-11-07 00:58:27,833 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 2 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,833 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 235 transitions. [2021-11-07 00:58:27,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-07 00:58:27,837 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:27,837 INFO L513 BasicCegarLoop]: trace histogram [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] [2021-11-07 00:58:27,837 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-07 00:58:27,838 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:27,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:27,850 INFO L85 PathProgramCache]: Analyzing trace with hash -1902504476, now seen corresponding path program 1 times [2021-11-07 00:58:27,850 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:27,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646381181] [2021-11-07 00:58:27,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:27,853 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:27,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:27,938 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:27,939 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:27,939 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646381181] [2021-11-07 00:58:27,939 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646381181] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:27,939 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:27,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:58:27,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008176418] [2021-11-07 00:58:27,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:58:27,940 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:27,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:58:27,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:27,941 INFO L87 Difference]: Start difference. First operand 169 states and 235 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:27,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:27,996 INFO L93 Difference]: Finished difference Result 298 states and 426 transitions. [2021-11-07 00:58:27,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:58:27,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-11-07 00:58:27,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:28,003 INFO L225 Difference]: With dead ends: 298 [2021-11-07 00:58:28,003 INFO L226 Difference]: Without dead ends: 197 [2021-11-07 00:58:28,007 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:28,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2021-11-07 00:58:28,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 183. [2021-11-07 00:58:28,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.419889502762431) internal successors, (257), 182 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 257 transitions. [2021-11-07 00:58:28,039 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 257 transitions. Word has length 29 [2021-11-07 00:58:28,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:28,040 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 257 transitions. [2021-11-07 00:58:28,040 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,040 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 257 transitions. [2021-11-07 00:58:28,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 00:58:28,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:28,048 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 00:58:28,048 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-07 00:58:28,049 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:28,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:28,050 INFO L85 PathProgramCache]: Analyzing trace with hash -2047487052, now seen corresponding path program 1 times [2021-11-07 00:58:28,050 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:28,050 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662857402] [2021-11-07 00:58:28,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:28,051 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:28,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:28,144 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:28,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:28,145 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662857402] [2021-11-07 00:58:28,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662857402] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:28,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:28,146 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:58:28,146 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122911469] [2021-11-07 00:58:28,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:58:28,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:28,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:58:28,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:28,148 INFO L87 Difference]: Start difference. First operand 183 states and 257 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:28,175 INFO L93 Difference]: Finished difference Result 309 states and 439 transitions. [2021-11-07 00:58:28,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:58:28,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-07 00:58:28,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:28,177 INFO L225 Difference]: With dead ends: 309 [2021-11-07 00:58:28,178 INFO L226 Difference]: Without dead ends: 194 [2021-11-07 00:58:28,178 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:28,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2021-11-07 00:58:28,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 183. [2021-11-07 00:58:28,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 181 states have (on average 1.3591160220994476) internal successors, (246), 182 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 246 transitions. [2021-11-07 00:58:28,191 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 246 transitions. Word has length 42 [2021-11-07 00:58:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:28,192 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 246 transitions. [2021-11-07 00:58:28,192 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,193 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 246 transitions. [2021-11-07 00:58:28,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2021-11-07 00:58:28,194 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:28,194 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 00:58:28,194 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-07 00:58:28,195 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:28,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:28,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1107128533, now seen corresponding path program 1 times [2021-11-07 00:58:28,196 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:28,196 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47188428] [2021-11-07 00:58:28,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:28,196 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:28,334 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 00:58:28,334 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:28,334 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47188428] [2021-11-07 00:58:28,335 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47188428] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:28,335 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:28,335 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:58:28,335 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982641633] [2021-11-07 00:58:28,337 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:28,337 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:28,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:28,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:28,338 INFO L87 Difference]: Start difference. First operand 183 states and 246 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:28,462 INFO L93 Difference]: Finished difference Result 499 states and 672 transitions. [2021-11-07 00:58:28,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:58:28,463 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2021-11-07 00:58:28,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:28,465 INFO L225 Difference]: With dead ends: 499 [2021-11-07 00:58:28,465 INFO L226 Difference]: Without dead ends: 323 [2021-11-07 00:58:28,468 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:28,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2021-11-07 00:58:28,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 255. [2021-11-07 00:58:28,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 255 states, 253 states have (on average 1.3478260869565217) internal successors, (341), 254 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 341 transitions. [2021-11-07 00:58:28,506 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 341 transitions. Word has length 42 [2021-11-07 00:58:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:28,507 INFO L470 AbstractCegarLoop]: Abstraction has 255 states and 341 transitions. [2021-11-07 00:58:28,507 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 341 transitions. [2021-11-07 00:58:28,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2021-11-07 00:58:28,509 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:28,509 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 00:58:28,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-07 00:58:28,510 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:28,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:28,510 INFO L85 PathProgramCache]: Analyzing trace with hash -716675109, now seen corresponding path program 1 times [2021-11-07 00:58:28,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:28,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127552813] [2021-11-07 00:58:28,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:28,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:28,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:28,628 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:28,631 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:28,632 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127552813] [2021-11-07 00:58:28,632 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127552813] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:28,632 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:28,632 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 00:58:28,633 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555907676] [2021-11-07 00:58:28,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:28,633 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:28,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:28,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:28,635 INFO L87 Difference]: Start difference. First operand 255 states and 341 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:28,686 INFO L93 Difference]: Finished difference Result 450 states and 609 transitions. [2021-11-07 00:58:28,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-07 00:58:28,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2021-11-07 00:58:28,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:28,691 INFO L225 Difference]: With dead ends: 450 [2021-11-07 00:58:28,691 INFO L226 Difference]: Without dead ends: 202 [2021-11-07 00:58:28,693 INFO L786 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-11-07 00:58:28,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2021-11-07 00:58:28,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 164. [2021-11-07 00:58:28,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.3580246913580247) internal successors, (220), 163 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 220 transitions. [2021-11-07 00:58:28,706 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 220 transitions. Word has length 43 [2021-11-07 00:58:28,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:28,706 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 220 transitions. [2021-11-07 00:58:28,707 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 4 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,707 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 220 transitions. [2021-11-07 00:58:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 00:58:28,712 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:28,712 INFO L513 BasicCegarLoop]: trace histogram [3, 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-11-07 00:58:28,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-07 00:58:28,713 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:28,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -149349018, now seen corresponding path program 1 times [2021-11-07 00:58:28,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:28,721 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491976973] [2021-11-07 00:58:28,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:28,721 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:28,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:28,830 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:28,831 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:28,831 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491976973] [2021-11-07 00:58:28,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491976973] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:28,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:28,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:58:28,833 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193430521] [2021-11-07 00:58:28,833 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:58:28,833 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:28,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:58:28,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:28,835 INFO L87 Difference]: Start difference. First operand 164 states and 220 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:28,868 INFO L93 Difference]: Finished difference Result 299 states and 407 transitions. [2021-11-07 00:58:28,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:58:28,868 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-07 00:58:28,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:28,873 INFO L225 Difference]: With dead ends: 299 [2021-11-07 00:58:28,873 INFO L226 Difference]: Without dead ends: 164 [2021-11-07 00:58:28,874 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:28,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2021-11-07 00:58:28,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2021-11-07 00:58:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.3209876543209877) internal successors, (214), 163 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 214 transitions. [2021-11-07 00:58:28,887 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 214 transitions. Word has length 45 [2021-11-07 00:58:28,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:28,888 INFO L470 AbstractCegarLoop]: Abstraction has 164 states and 214 transitions. [2021-11-07 00:58:28,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:28,889 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 214 transitions. [2021-11-07 00:58:28,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2021-11-07 00:58:28,891 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:28,891 INFO L513 BasicCegarLoop]: trace histogram [3, 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-11-07 00:58:28,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-07 00:58:28,894 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:28,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1219772697, now seen corresponding path program 1 times [2021-11-07 00:58:28,894 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:28,895 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053110632] [2021-11-07 00:58:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:28,896 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:28,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:28,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:28,987 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:28,987 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053110632] [2021-11-07 00:58:28,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053110632] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:28,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:28,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:58:28,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303045534] [2021-11-07 00:58:28,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-07 00:58:28,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:28,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-07 00:58:28,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:28,990 INFO L87 Difference]: Start difference. First operand 164 states and 214 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:29,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:29,042 INFO L93 Difference]: Finished difference Result 300 states and 396 transitions. [2021-11-07 00:58:29,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-07 00:58:29,042 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 45 [2021-11-07 00:58:29,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:29,044 INFO L225 Difference]: With dead ends: 300 [2021-11-07 00:58:29,044 INFO L226 Difference]: Without dead ends: 165 [2021-11-07 00:58:29,045 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-07 00:58:29,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2021-11-07 00:58:29,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2021-11-07 00:58:29,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 1.2375) internal successors, (198), 161 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:29,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 198 transitions. [2021-11-07 00:58:29,056 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 198 transitions. Word has length 45 [2021-11-07 00:58:29,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:29,058 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 198 transitions. [2021-11-07 00:58:29,059 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:29,059 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 198 transitions. [2021-11-07 00:58:29,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2021-11-07 00:58:29,060 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:29,060 INFO L513 BasicCegarLoop]: trace histogram [3, 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-11-07 00:58:29,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-07 00:58:29,061 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:29,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:29,061 INFO L85 PathProgramCache]: Analyzing trace with hash 124516177, now seen corresponding path program 1 times [2021-11-07 00:58:29,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:29,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508280747] [2021-11-07 00:58:29,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:29,062 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:29,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:29,168 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:29,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:29,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508280747] [2021-11-07 00:58:29,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508280747] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:29,170 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [330559794] [2021-11-07 00:58:29,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:29,171 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:29,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:29,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:29,188 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-11-07 00:58:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:29,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 15 conjunts are in the unsatisfiable core [2021-11-07 00:58:29,309 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:29,647 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:29,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:30,115 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:30,116 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [330559794] provided 1 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:30,116 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2021-11-07 00:58:30,116 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 6] total 9 [2021-11-07 00:58:30,116 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701466264] [2021-11-07 00:58:30,117 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:30,117 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:30,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:30,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:30,121 INFO L87 Difference]: Start difference. First operand 162 states and 198 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:30,194 INFO L93 Difference]: Finished difference Result 337 states and 421 transitions. [2021-11-07 00:58:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:58:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2021-11-07 00:58:30,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:30,196 INFO L225 Difference]: With dead ends: 337 [2021-11-07 00:58:30,197 INFO L226 Difference]: Without dead ends: 251 [2021-11-07 00:58:30,198 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2021-11-07 00:58:30,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2021-11-07 00:58:30,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 162. [2021-11-07 00:58:30,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 160 states have (on average 1.2125) internal successors, (194), 161 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:30,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 194 transitions. [2021-11-07 00:58:30,211 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 194 transitions. Word has length 46 [2021-11-07 00:58:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:30,211 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 194 transitions. [2021-11-07 00:58:30,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:30,211 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 194 transitions. [2021-11-07 00:58:30,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 00:58:30,213 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:30,213 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 00:58:30,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-11-07 00:58:30,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:30,432 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:30,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:30,432 INFO L85 PathProgramCache]: Analyzing trace with hash 2027240905, now seen corresponding path program 1 times [2021-11-07 00:58:30,432 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:30,433 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795717125] [2021-11-07 00:58:30,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:30,433 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:30,479 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:30,480 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:30,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795717125] [2021-11-07 00:58:30,480 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795717125] provided 0 perfect and 1 imperfect interpolant sequences [2021-11-07 00:58:30,480 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1055920296] [2021-11-07 00:58:30,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:30,481 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:30,481 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 [2021-11-07 00:58:30,482 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-11-07 00:58:30,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-11-07 00:58:30,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:30,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 2 conjunts are in the unsatisfiable core [2021-11-07 00:58:30,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-11-07 00:58:30,753 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:30,753 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-11-07 00:58:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-07 00:58:30,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1055920296] provided 2 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:30,878 INFO L186 FreeRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2021-11-07 00:58:30,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [5] total 7 [2021-11-07 00:58:30,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624703282] [2021-11-07 00:58:30,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:30,880 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:30,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:30,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 00:58:30,881 INFO L87 Difference]: Start difference. First operand 162 states and 194 transitions. Second operand has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:30,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:30,927 INFO L93 Difference]: Finished difference Result 348 states and 421 transitions. [2021-11-07 00:58:30,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:58:30,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-07 00:58:30,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:30,930 INFO L225 Difference]: With dead ends: 348 [2021-11-07 00:58:30,930 INFO L226 Difference]: Without dead ends: 216 [2021-11-07 00:58:30,931 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-11-07 00:58:30,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2021-11-07 00:58:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 176. [2021-11-07 00:58:30,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.235632183908046) internal successors, (215), 175 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:30,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 215 transitions. [2021-11-07 00:58:30,945 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 215 transitions. Word has length 47 [2021-11-07 00:58:30,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:30,946 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 215 transitions. [2021-11-07 00:58:30,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.0) internal successors, (52), 4 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:30,946 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 215 transitions. [2021-11-07 00:58:30,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 00:58:30,960 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:30,960 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 00:58:31,004 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-11-07 00:58:31,183 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-11-07 00:58:31,184 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:31,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:31,184 INFO L85 PathProgramCache]: Analyzing trace with hash -1168328959, now seen corresponding path program 1 times [2021-11-07 00:58:31,184 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:31,184 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137171548] [2021-11-07 00:58:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:31,185 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:31,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-07 00:58:31,237 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:31,238 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137171548] [2021-11-07 00:58:31,238 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137171548] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:31,238 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:31,238 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 00:58:31,238 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521772189] [2021-11-07 00:58:31,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:31,239 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:31,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:31,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:31,240 INFO L87 Difference]: Start difference. First operand 176 states and 215 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:31,314 INFO L93 Difference]: Finished difference Result 316 states and 387 transitions. [2021-11-07 00:58:31,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:58:31,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-07 00:58:31,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:31,316 INFO L225 Difference]: With dead ends: 316 [2021-11-07 00:58:31,316 INFO L226 Difference]: Without dead ends: 225 [2021-11-07 00:58:31,317 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:31,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2021-11-07 00:58:31,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 207. [2021-11-07 00:58:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 205 states have (on average 1.2097560975609756) internal successors, (248), 206 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 248 transitions. [2021-11-07 00:58:31,332 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 248 transitions. Word has length 47 [2021-11-07 00:58:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:31,332 INFO L470 AbstractCegarLoop]: Abstraction has 207 states and 248 transitions. [2021-11-07 00:58:31,333 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 248 transitions. [2021-11-07 00:58:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2021-11-07 00:58:31,334 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:31,334 INFO L513 BasicCegarLoop]: trace histogram [3, 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] [2021-11-07 00:58:31,334 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-07 00:58:31,334 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:31,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:31,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1011027702, now seen corresponding path program 1 times [2021-11-07 00:58:31,335 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:31,335 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224410238] [2021-11-07 00:58:31,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:31,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:31,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2021-11-07 00:58:31,371 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:31,371 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224410238] [2021-11-07 00:58:31,371 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224410238] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:31,371 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:31,371 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-07 00:58:31,372 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936479053] [2021-11-07 00:58:31,372 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:31,372 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:31,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:31,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:31,373 INFO L87 Difference]: Start difference. First operand 207 states and 248 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:31,444 INFO L93 Difference]: Finished difference Result 476 states and 577 transitions. [2021-11-07 00:58:31,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:58:31,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2021-11-07 00:58:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:31,447 INFO L225 Difference]: With dead ends: 476 [2021-11-07 00:58:31,447 INFO L226 Difference]: Without dead ends: 277 [2021-11-07 00:58:31,448 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:31,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2021-11-07 00:58:31,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 252. [2021-11-07 00:58:31,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 250 states have (on average 1.18) internal successors, (295), 251 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 295 transitions. [2021-11-07 00:58:31,469 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 295 transitions. Word has length 47 [2021-11-07 00:58:31,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:31,470 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 295 transitions. [2021-11-07 00:58:31,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 3 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,471 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 295 transitions. [2021-11-07 00:58:31,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2021-11-07 00:58:31,471 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:31,472 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2021-11-07 00:58:31,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-07 00:58:31,472 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:31,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:31,473 INFO L85 PathProgramCache]: Analyzing trace with hash 505890041, now seen corresponding path program 1 times [2021-11-07 00:58:31,473 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:31,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409100958] [2021-11-07 00:58:31,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:31,474 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-07 00:58:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-07 00:58:31,539 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-07 00:58:31,539 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409100958] [2021-11-07 00:58:31,539 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409100958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-07 00:58:31,539 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-07 00:58:31,540 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-07 00:58:31,540 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931717114] [2021-11-07 00:58:31,540 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-07 00:58:31,541 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-07 00:58:31,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-07 00:58:31,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:31,542 INFO L87 Difference]: Start difference. First operand 252 states and 295 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-07 00:58:31,630 INFO L93 Difference]: Finished difference Result 514 states and 601 transitions. [2021-11-07 00:58:31,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-07 00:58:31,631 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2021-11-07 00:58:31,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-07 00:58:31,635 INFO L225 Difference]: With dead ends: 514 [2021-11-07 00:58:31,635 INFO L226 Difference]: Without dead ends: 512 [2021-11-07 00:58:31,636 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-07 00:58:31,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 512 states. [2021-11-07 00:58:31,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 512 to 374. [2021-11-07 00:58:31,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 372 states have (on average 1.1801075268817205) internal successors, (439), 373 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 439 transitions. [2021-11-07 00:58:31,682 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 439 transitions. Word has length 48 [2021-11-07 00:58:31,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-07 00:58:31,682 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 439 transitions. [2021-11-07 00:58:31,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-07 00:58:31,683 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 439 transitions. [2021-11-07 00:58:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2021-11-07 00:58:31,684 INFO L505 BasicCegarLoop]: Found error trace [2021-11-07 00:58:31,684 INFO L513 BasicCegarLoop]: trace histogram [3, 3, 3, 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-11-07 00:58:31,685 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-07 00:58:31,685 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-07 00:58:31,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-07 00:58:31,686 INFO L85 PathProgramCache]: Analyzing trace with hash 360231339, now seen corresponding path program 1 times [2021-11-07 00:58:31,686 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-07 00:58:31,687 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146691740] [2021-11-07 00:58:31,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-07 00:58:31,687 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-07 00:58:31,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 00:58:31,713 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-07 00:58:31,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-07 00:58:31,781 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-07 00:58:31,781 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-07 00:58:31,783 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 00:58:31,785 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-07 00:58:31,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-07 00:58:31,790 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-07 00:58:31,795 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-07 00:58:31,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 12:58:31 BoogieIcfgContainer [2021-11-07 00:58:31,940 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-07 00:58:31,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-07 00:58:31,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-07 00:58:31,941 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-07 00:58:31,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 12:58:26" (3/4) ... [2021-11-07 00:58:31,945 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-07 00:58:32,113 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/witness.graphml [2021-11-07 00:58:32,113 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-07 00:58:32,115 INFO L168 Benchmark]: Toolchain (without parser) took 7324.25 ms. Allocated memory was 86.0 MB in the beginning and 155.2 MB in the end (delta: 69.2 MB). Free memory was 49.6 MB in the beginning and 88.6 MB in the end (delta: -38.9 MB). Peak memory consumption was 30.4 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,116 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 86.0 MB. Free memory is still 66.0 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-07 00:58:32,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 404.87 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 49.4 MB in the beginning and 79.7 MB in the end (delta: -30.3 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.89 ms. Allocated memory is still 104.9 MB. Free memory was 79.5 MB in the beginning and 77.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,117 INFO L168 Benchmark]: Boogie Preprocessor took 95.47 ms. Allocated memory is still 104.9 MB. Free memory was 77.0 MB in the beginning and 74.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,118 INFO L168 Benchmark]: RCFGBuilder took 1492.93 ms. Allocated memory is still 104.9 MB. Free memory was 74.9 MB in the beginning and 50.8 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,118 INFO L168 Benchmark]: TraceAbstraction took 5027.61 ms. Allocated memory was 104.9 MB in the beginning and 155.2 MB in the end (delta: 50.3 MB). Free memory was 79.6 MB in the beginning and 98.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,119 INFO L168 Benchmark]: Witness Printer took 172.65 ms. Allocated memory is still 155.2 MB. Free memory was 98.1 MB in the beginning and 88.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-07 00:58:32,122 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.30 ms. Allocated memory is still 86.0 MB. Free memory is still 66.0 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 404.87 ms. Allocated memory was 86.0 MB in the beginning and 104.9 MB in the end (delta: 18.9 MB). Free memory was 49.4 MB in the beginning and 79.7 MB in the end (delta: -30.3 MB). Peak memory consumption was 5.7 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 88.89 ms. Allocated memory is still 104.9 MB. Free memory was 79.5 MB in the beginning and 77.0 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 95.47 ms. Allocated memory is still 104.9 MB. Free memory was 77.0 MB in the beginning and 74.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1492.93 ms. Allocated memory is still 104.9 MB. Free memory was 74.9 MB in the beginning and 50.8 MB in the end (delta: 24.1 MB). Peak memory consumption was 24.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5027.61 ms. Allocated memory was 104.9 MB in the beginning and 155.2 MB in the end (delta: 50.3 MB). Free memory was 79.6 MB in the beginning and 98.1 MB in the end (delta: -18.4 MB). Peak memory consumption was 32.4 MB. Max. memory is 16.1 GB. * Witness Printer took 172.65 ms. Allocated memory is still 155.2 MB. Free memory was 98.1 MB in the beginning and 88.6 MB in the end (delta: 9.5 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 20]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L24] int m_pc = 0; [L25] int t1_pc = 0; [L26] int m_st ; [L27] int t1_st ; [L28] int m_i ; [L29] int t1_i ; [L30] int M_E = 2; [L31] int T1_E = 2; [L32] int E_M = 2; [L33] int E_1 = 2; [L37] int token ; [L39] int local ; [L485] int __retres1 ; [L400] m_i = 1 [L401] t1_i = 1 [L426] int kernel_st ; [L427] int tmp ; [L428] int tmp___0 ; [L432] kernel_st = 0 [L182] COND TRUE m_i == 1 [L183] m_st = 0 [L187] COND TRUE t1_i == 1 [L188] t1_st = 0 [L271] COND FALSE !(M_E == 0) [L276] COND FALSE !(T1_E == 0) [L281] COND FALSE !(E_M == 0) [L286] COND FALSE !(E_1 == 0) [L324] int tmp ; [L325] int tmp___0 ; [L133] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L136] COND FALSE !(m_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L146] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L148] return (__retres1); [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) [L152] int __retres1 ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L155] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L165] __retres1 = 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L167] return (__retres1); [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) [L299] COND FALSE !(M_E == 1) [L304] COND FALSE !(T1_E == 1) [L309] COND FALSE !(E_M == 1) [L314] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L440] COND TRUE 1 [L443] kernel_st = 1 [L218] int tmp ; VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L222] COND TRUE 1 [L197] int __retres1 ; [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 [L213] return (__retres1); [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, token=0] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L100] COND TRUE t1_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, token=0] [L111] COND TRUE 1 [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L222] COND TRUE 1 [L197] int __retres1 ; [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 [L213] return (__retres1); [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND TRUE m_pc == 0 VAL [E_1=2, E_M=2, local=0, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=0] [L55] COND TRUE 1 [L58] token = __VERIFIER_nondet_int() [L59] local = token [L60] E_1 = 1 [L324] int tmp ; [L325] int tmp___0 ; [L133] int __retres1 ; VAL [E_1=1, E_M=2, local=6, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=6] [L136] COND FALSE !(m_pc == 1) VAL [E_1=1, E_M=2, local=6, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=6] [L146] __retres1 = 0 VAL [E_1=1, E_M=2, local=6, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=6] [L148] return (__retres1); [L329] tmp = is_master_triggered() [L331] COND FALSE !(\read(tmp)) [L152] int __retres1 ; VAL [E_1=1, E_M=2, local=6, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=6] [L155] COND TRUE t1_pc == 1 VAL [E_1=1, E_M=2, local=6, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=6] [L156] COND TRUE E_1 == 1 [L157] __retres1 = 1 VAL [E_1=1, E_M=2, local=6, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=6] [L167] return (__retres1); [L337] tmp___0 = is_transmit1_triggered() [L339] COND TRUE \read(tmp___0) [L340] t1_st = 0 [L62] E_1 = 2 [L63] m_pc = 1 [L64] m_st = 2 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, token=6] [L246] COND TRUE t1_st == 0 [L247] int tmp_ndt_2; [L248] tmp_ndt_2 = __VERIFIER_nondet_int() [L249] COND TRUE \read(tmp_ndt_2) [L251] t1_st = 1 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=6] [L100] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=6] [L103] COND TRUE t1_pc == 1 [L119] token += 1 [L120] E_M = 1 [L324] int tmp ; [L325] int tmp___0 ; [L133] int __retres1 ; VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L136] COND TRUE m_pc == 1 VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L137] COND TRUE E_M == 1 [L138] __retres1 = 1 VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L148] return (__retres1); [L329] tmp = is_master_triggered() [L331] COND TRUE \read(tmp) [L332] m_st = 0 [L152] int __retres1 ; VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L155] COND TRUE t1_pc == 1 VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L156] COND FALSE !(E_1 == 1) VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L165] __retres1 = 0 VAL [E_1=2, E_M=1, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L167] return (__retres1); [L337] tmp___0 = is_transmit1_triggered() [L339] COND FALSE !(\read(tmp___0)) [L122] E_M = 2 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, token=7] [L111] COND TRUE 1 [L113] t1_pc = 1 [L114] t1_st = 2 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L222] COND TRUE 1 [L197] int __retres1 ; [L200] COND TRUE m_st == 0 [L201] __retres1 = 1 [L213] return (__retres1); [L225] tmp = exists_runnable_thread() [L227] COND TRUE \read(tmp) VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L232] COND TRUE m_st == 0 [L233] int tmp_ndt_1; [L234] tmp_ndt_1 = __VERIFIER_nondet_int() [L235] COND TRUE \read(tmp_ndt_1) [L237] m_st = 1 [L42] int tmp_var = __VERIFIER_nondet_int(); [L44] COND FALSE !(m_pc == 0) VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L47] COND TRUE m_pc == 1 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L69] COND FALSE !(token != local + 1) [L74] COND TRUE tmp_var <= 5 [L75] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L80] COND TRUE tmp_var <= 5 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L81] COND TRUE tmp_var >= 5 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L82] COND TRUE tmp_var == 5 VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] [L20] reach_error() VAL [E_1=2, E_M=2, local=6, M_E=2, m_i=1, m_pc=1, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, token=7] - UnprovableResult [Line: 20]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 68 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 14, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1324 SDtfs, 928 SDslu, 1147 SDs, 0 SdLazy, 291 SolverSat, 74 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 235 GetRequests, 205 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=374occurred in iteration=13, InterpolantAutomatonStates: 47, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 13 MinimizatonAttempts, 460 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 657 NumberOfCodeBlocks, 657 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 682 ConstructedInterpolants, 0 QuantifiedInterpolants, 1506 SizeOfPredicates, 3 NumberOfNonLiveVariables, 476 ConjunctsInSsa, 17 ConjunctsInUnsatCore, 17 InterpolantComputations, 14 PerfectInterpolantSequences, 167/172 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! [2021-11-07 00:58:32,185 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5291ce61-c4f4-49c3-bd18-d42218b6dfe2/bin/utaipan-UUZaoUuFF8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE