./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.04.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/config/TaipanReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.04.cil.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH --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 1ec3ea32382f407cf861c3067ab994313a1de2b62bed831e309aa68653121144 --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 04:02:35,313 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 04:02:35,316 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 04:02:35,377 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 04:02:35,378 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 04:02:35,383 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 04:02:35,386 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 04:02:35,390 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 04:02:35,393 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 04:02:35,400 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 04:02:35,401 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 04:02:35,402 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 04:02:35,403 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 04:02:35,404 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 04:02:35,406 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 04:02:35,408 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 04:02:35,409 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 04:02:35,410 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 04:02:35,413 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 04:02:35,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 04:02:35,418 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 04:02:35,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 04:02:35,422 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 04:02:35,423 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 04:02:35,427 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 04:02:35,428 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 04:02:35,428 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 04:02:35,429 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 04:02:35,430 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 04:02:35,432 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 04:02:35,432 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 04:02:35,433 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 04:02:35,434 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 04:02:35,435 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 04:02:35,437 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 04:02:35,438 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 04:02:35,439 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 04:02:35,439 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 04:02:35,440 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 04:02:35,441 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 04:02:35,442 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 04:02:35,443 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-11-03 04:02:35,470 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 04:02:35,470 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 04:02:35,471 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 04:02:35,472 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 04:02:35,472 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 04:02:35,473 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 04:02:35,473 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 04:02:35,473 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 04:02:35,473 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 04:02:35,474 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 04:02:35,474 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 04:02:35,474 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 04:02:35,475 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 04:02:35,475 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 04:02:35,475 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 04:02:35,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 04:02:35,476 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 04:02:35,477 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 04:02:35,477 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 04:02:35,477 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 04:02:35,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-11-03 04:02:35,478 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 04:02:35,478 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-11-03 04:02:35,478 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 04:02:35,478 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 04:02:35,479 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-11-03 04:02:35,479 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 04:02:35,479 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-11-03 04:02:35,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 04:02:35,480 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 04:02:35,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:02:35,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 04:02:35,481 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 04:02:35,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-11-03 04:02:35,481 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 04:02:35,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 04:02:35,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-11-03 04:02:35,482 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 04:02:35,482 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 04:02:35,482 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_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/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_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH 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 -> 1ec3ea32382f407cf861c3067ab994313a1de2b62bed831e309aa68653121144 [2021-11-03 04:02:35,755 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 04:02:35,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 04:02:35,794 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 04:02:35,795 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 04:02:35,796 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 04:02:35,797 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/systemc/transmitter.04.cil.c [2021-11-03 04:02:35,897 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/data/fa76bf663/0e8d44e575454837b108872579ae8942/FLAG2b52b0ffd [2021-11-03 04:02:36,622 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 04:02:36,636 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/sv-benchmarks/c/systemc/transmitter.04.cil.c [2021-11-03 04:02:36,655 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/data/fa76bf663/0e8d44e575454837b108872579ae8942/FLAG2b52b0ffd [2021-11-03 04:02:36,926 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/data/fa76bf663/0e8d44e575454837b108872579ae8942 [2021-11-03 04:02:36,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 04:02:36,931 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 04:02:36,932 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 04:02:36,933 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 04:02:36,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 04:02:36,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:02:36" (1/1) ... [2021-11-03 04:02:36,938 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11806862 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:36, skipping insertion in model container [2021-11-03 04:02:36,939 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 04:02:36" (1/1) ... [2021-11-03 04:02:36,946 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 04:02:36,983 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 04:02:37,183 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_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/sv-benchmarks/c/systemc/transmitter.04.cil.c[401,414] [2021-11-03 04:02:37,263 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:02:37,272 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 04:02:37,285 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/sv-benchmarks/c/systemc/transmitter.04.cil.c[401,414] [2021-11-03 04:02:37,329 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 04:02:37,349 INFO L208 MainTranslator]: Completed translation [2021-11-03 04:02:37,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37 WrapperNode [2021-11-03 04:02:37,349 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 04:02:37,351 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 04:02:37,351 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 04:02:37,351 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 04:02:37,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,422 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 04:02:37,423 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 04:02:37,423 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 04:02:37,423 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 04:02:37,433 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,433 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,441 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,441 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,509 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,522 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 04:02:37,523 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 04:02:37,534 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 04:02:37,535 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 04:02:37,536 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (1/1) ... [2021-11-03 04:02:37,554 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 04:02:37,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 04:02:37,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 04:02:37,624 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 04:02:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 04:02:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 04:02:37,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 04:02:37,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 04:02:40,096 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 04:02:40,097 INFO L299 CfgBuilder]: Removed 148 assume(true) statements. [2021-11-03 04:02:40,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:02:40 BoogieIcfgContainer [2021-11-03 04:02:40,102 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 04:02:40,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 04:02:40,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 04:02:40,110 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 04:02:40,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 04:02:36" (1/3) ... [2021-11-03 04:02:40,111 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dc66de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:02:40, skipping insertion in model container [2021-11-03 04:02:40,112 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 04:02:37" (2/3) ... [2021-11-03 04:02:40,113 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36dc66de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 04:02:40, skipping insertion in model container [2021-11-03 04:02:40,113 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:02:40" (3/3) ... [2021-11-03 04:02:40,115 INFO L111 eAbstractionObserver]: Analyzing ICFG transmitter.04.cil.c [2021-11-03 04:02:40,122 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 04:02:40,122 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-11-03 04:02:40,196 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 04:02:40,203 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-03 04:02:40,204 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-11-03 04:02:40,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 177 states have internal predecessors, (274), 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-03 04:02:40,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:02:40,242 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:40,244 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:02:40,245 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:40,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:40,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1562977161, now seen corresponding path program 1 times [2021-11-03 04:02:40,267 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:40,270 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476012721] [2021-11-03 04:02:40,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:40,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:40,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:40,585 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-03 04:02:40,586 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:40,586 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476012721] [2021-11-03 04:02:40,587 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476012721] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:40,588 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:40,588 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:02:40,599 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892836382] [2021-11-03 04:02:40,606 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:40,606 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:40,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:40,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:40,632 INFO L87 Difference]: Start difference. First operand has 178 states, 176 states have (on average 1.5568181818181819) internal successors, (274), 177 states have internal predecessors, (274), 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 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:40,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:40,838 INFO L93 Difference]: Finished difference Result 481 states and 740 transitions. [2021-11-03 04:02:40,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:40,840 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-03 04:02:40,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:40,866 INFO L225 Difference]: With dead ends: 481 [2021-11-03 04:02:40,867 INFO L226 Difference]: Without dead ends: 305 [2021-11-03 04:02:40,873 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-03 04:02:40,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-11-03 04:02:40,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2021-11-03 04:02:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 301 states have (on average 1.5016611295681064) internal successors, (452), 301 states have internal predecessors, (452), 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-03 04:02:40,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 452 transitions. [2021-11-03 04:02:40,989 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 452 transitions. Word has length 28 [2021-11-03 04:02:40,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:40,990 INFO L470 AbstractCegarLoop]: Abstraction has 302 states and 452 transitions. [2021-11-03 04:02:40,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 2 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:40,991 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 452 transitions. [2021-11-03 04:02:40,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:02:40,994 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:40,994 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:02:40,995 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 04:02:40,995 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:40,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:40,999 INFO L85 PathProgramCache]: Analyzing trace with hash 1141595158, now seen corresponding path program 1 times [2021-11-03 04:02:41,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:41,000 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31859084] [2021-11-03 04:02:41,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:41,001 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:41,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:41,143 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-03 04:02:41,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:41,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31859084] [2021-11-03 04:02:41,144 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31859084] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:41,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:41,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:41,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225290747] [2021-11-03 04:02:41,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:02:41,147 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:41,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:02:41,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:02:41,151 INFO L87 Difference]: Start difference. First operand 302 states and 452 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:41,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:41,362 INFO L93 Difference]: Finished difference Result 1071 states and 1593 transitions. [2021-11-03 04:02:41,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:02:41,364 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-03 04:02:41,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:41,370 INFO L225 Difference]: With dead ends: 1071 [2021-11-03 04:02:41,370 INFO L226 Difference]: Without dead ends: 771 [2021-11-03 04:02:41,376 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 04:02:41,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2021-11-03 04:02:41,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 712. [2021-11-03 04:02:41,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 711 states have (on average 1.4571026722925458) internal successors, (1036), 711 states have internal predecessors, (1036), 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-03 04:02:41,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1036 transitions. [2021-11-03 04:02:41,436 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1036 transitions. Word has length 28 [2021-11-03 04:02:41,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:41,437 INFO L470 AbstractCegarLoop]: Abstraction has 712 states and 1036 transitions. [2021-11-03 04:02:41,437 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:41,438 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1036 transitions. [2021-11-03 04:02:41,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-11-03 04:02:41,445 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:41,445 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:02:41,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 04:02:41,446 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:41,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:41,447 INFO L85 PathProgramCache]: Analyzing trace with hash -2013020427, now seen corresponding path program 1 times [2021-11-03 04:02:41,448 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:41,448 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540262685] [2021-11-03 04:02:41,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:41,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:41,553 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-03 04:02:41,554 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:41,554 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540262685] [2021-11-03 04:02:41,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540262685] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:41,556 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:41,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:41,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900141890] [2021-11-03 04:02:41,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:02:41,562 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:41,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:02:41,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:02:41,564 INFO L87 Difference]: Start difference. First operand 712 states and 1036 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:41,708 INFO L93 Difference]: Finished difference Result 2003 states and 2930 transitions. [2021-11-03 04:02:41,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:02:41,709 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2021-11-03 04:02:41,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:41,721 INFO L225 Difference]: With dead ends: 2003 [2021-11-03 04:02:41,721 INFO L226 Difference]: Without dead ends: 1309 [2021-11-03 04:02:41,723 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-03 04:02:41,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1309 states. [2021-11-03 04:02:41,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1309 to 1025. [2021-11-03 04:02:41,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1024 states have (on average 1.4609375) internal successors, (1496), 1024 states have internal predecessors, (1496), 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-03 04:02:41,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1496 transitions. [2021-11-03 04:02:41,806 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1496 transitions. Word has length 28 [2021-11-03 04:02:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:41,807 INFO L470 AbstractCegarLoop]: Abstraction has 1025 states and 1496 transitions. [2021-11-03 04:02:41,807 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:41,807 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1496 transitions. [2021-11-03 04:02:41,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-11-03 04:02:41,809 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:41,809 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:02:41,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 04:02:41,810 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1481947965, now seen corresponding path program 1 times [2021-11-03 04:02:41,811 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:41,811 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119611818] [2021-11-03 04:02:41,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:41,812 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:41,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:41,910 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-03 04:02:41,910 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:41,910 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119611818] [2021-11-03 04:02:41,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119611818] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:41,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:41,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:02:41,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470301589] [2021-11-03 04:02:41,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:41,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:41,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:41,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:41,913 INFO L87 Difference]: Start difference. First operand 1025 states and 1496 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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-03 04:02:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:42,024 INFO L93 Difference]: Finished difference Result 2991 states and 4349 transitions. [2021-11-03 04:02:42,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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-03 04:02:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:42,037 INFO L225 Difference]: With dead ends: 2991 [2021-11-03 04:02:42,038 INFO L226 Difference]: Without dead ends: 1981 [2021-11-03 04:02:42,042 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-03 04:02:42,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1981 states. [2021-11-03 04:02:42,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1981 to 1972. [2021-11-03 04:02:42,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1972 states, 1971 states have (on average 1.4271943176052766) internal successors, (2813), 1971 states have internal predecessors, (2813), 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-03 04:02:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1972 states to 1972 states and 2813 transitions. [2021-11-03 04:02:42,140 INFO L78 Accepts]: Start accepts. Automaton has 1972 states and 2813 transitions. Word has length 29 [2021-11-03 04:02:42,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:42,141 INFO L470 AbstractCegarLoop]: Abstraction has 1972 states and 2813 transitions. [2021-11-03 04:02:42,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 2 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-03 04:02:42,143 INFO L276 IsEmpty]: Start isEmpty. Operand 1972 states and 2813 transitions. [2021-11-03 04:02:42,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-11-03 04:02:42,172 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:42,173 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:02:42,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 04:02:42,173 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:42,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:42,174 INFO L85 PathProgramCache]: Analyzing trace with hash 65734536, now seen corresponding path program 1 times [2021-11-03 04:02:42,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:42,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876681517] [2021-11-03 04:02:42,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:42,175 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:42,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:42,231 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-03 04:02:42,232 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:42,232 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876681517] [2021-11-03 04:02:42,232 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876681517] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:42,232 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:42,233 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:42,233 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404149767] [2021-11-03 04:02:42,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:42,234 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:42,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:42,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:42,235 INFO L87 Difference]: Start difference. First operand 1972 states and 2813 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) 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-03 04:02:42,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:42,364 INFO L93 Difference]: Finished difference Result 3744 states and 5418 transitions. [2021-11-03 04:02:42,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:42,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) 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 40 [2021-11-03 04:02:42,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:42,382 INFO L225 Difference]: With dead ends: 3744 [2021-11-03 04:02:42,383 INFO L226 Difference]: Without dead ends: 2737 [2021-11-03 04:02:42,385 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-03 04:02:42,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2737 states. [2021-11-03 04:02:42,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2737 to 2143. [2021-11-03 04:02:42,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2143 states, 2142 states have (on average 1.4491129785247432) internal successors, (3104), 2142 states have internal predecessors, (3104), 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-03 04:02:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2143 states to 2143 states and 3104 transitions. [2021-11-03 04:02:42,504 INFO L78 Accepts]: Start accepts. Automaton has 2143 states and 3104 transitions. Word has length 40 [2021-11-03 04:02:42,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:42,505 INFO L470 AbstractCegarLoop]: Abstraction has 2143 states and 3104 transitions. [2021-11-03 04:02:42,505 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) 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-03 04:02:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand 2143 states and 3104 transitions. [2021-11-03 04:02:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-03 04:02:42,511 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:42,511 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:42,512 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 04:02:42,512 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:42,513 INFO L85 PathProgramCache]: Analyzing trace with hash 1652373574, now seen corresponding path program 1 times [2021-11-03 04:02:42,513 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:42,513 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747550938] [2021-11-03 04:02:42,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:42,514 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:42,561 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-03 04:02:42,562 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:42,562 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747550938] [2021-11-03 04:02:42,562 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747550938] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:42,562 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:42,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:42,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108542524] [2021-11-03 04:02:42,563 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:42,564 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:42,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:42,565 INFO L87 Difference]: Start difference. First operand 2143 states and 3104 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-03 04:02:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:42,734 INFO L93 Difference]: Finished difference Result 4965 states and 7303 transitions. [2021-11-03 04:02:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:42,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2021-11-03 04:02:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:42,754 INFO L225 Difference]: With dead ends: 4965 [2021-11-03 04:02:42,754 INFO L226 Difference]: Without dead ends: 2839 [2021-11-03 04:02:42,758 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-03 04:02:42,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2839 states. [2021-11-03 04:02:42,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2839 to 2629. [2021-11-03 04:02:42,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2629 states, 2628 states have (on average 1.4893455098934552) internal successors, (3914), 2628 states have internal predecessors, (3914), 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-03 04:02:42,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2629 states to 2629 states and 3914 transitions. [2021-11-03 04:02:42,902 INFO L78 Accepts]: Start accepts. Automaton has 2629 states and 3914 transitions. Word has length 59 [2021-11-03 04:02:42,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:42,903 INFO L470 AbstractCegarLoop]: Abstraction has 2629 states and 3914 transitions. [2021-11-03 04:02:42,903 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-03 04:02:42,904 INFO L276 IsEmpty]: Start isEmpty. Operand 2629 states and 3914 transitions. [2021-11-03 04:02:42,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2021-11-03 04:02:42,910 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:42,911 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:42,911 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 04:02:42,911 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1831223825, now seen corresponding path program 1 times [2021-11-03 04:02:42,912 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:42,913 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780970160] [2021-11-03 04:02:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:42,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:43,016 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-03 04:02:43,016 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:43,017 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780970160] [2021-11-03 04:02:43,017 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780970160] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:43,017 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:43,017 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:43,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623702275] [2021-11-03 04:02:43,018 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:43,018 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:43,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:43,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:43,019 INFO L87 Difference]: Start difference. First operand 2629 states and 3914 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-03 04:02:43,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:43,274 INFO L93 Difference]: Finished difference Result 6636 states and 9997 transitions. [2021-11-03 04:02:43,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:43,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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 59 [2021-11-03 04:02:43,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:43,304 INFO L225 Difference]: With dead ends: 6636 [2021-11-03 04:02:43,304 INFO L226 Difference]: Without dead ends: 4024 [2021-11-03 04:02:43,311 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-03 04:02:43,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4024 states. [2021-11-03 04:02:43,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4024 to 3466. [2021-11-03 04:02:43,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3466 states, 3465 states have (on average 1.5217893217893217) internal successors, (5273), 3465 states have internal predecessors, (5273), 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-03 04:02:43,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3466 states to 3466 states and 5273 transitions. [2021-11-03 04:02:43,550 INFO L78 Accepts]: Start accepts. Automaton has 3466 states and 5273 transitions. Word has length 59 [2021-11-03 04:02:43,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:43,550 INFO L470 AbstractCegarLoop]: Abstraction has 3466 states and 5273 transitions. [2021-11-03 04:02:43,551 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 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-03 04:02:43,551 INFO L276 IsEmpty]: Start isEmpty. Operand 3466 states and 5273 transitions. [2021-11-03 04:02:43,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 04:02:43,559 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:43,559 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:43,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 04:02:43,560 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:43,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:43,560 INFO L85 PathProgramCache]: Analyzing trace with hash 200151229, now seen corresponding path program 1 times [2021-11-03 04:02:43,561 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:43,561 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423388183] [2021-11-03 04:02:43,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:43,561 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:43,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:02:43,647 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:43,647 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423388183] [2021-11-03 04:02:43,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423388183] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:43,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:43,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:43,648 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229083530] [2021-11-03 04:02:43,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:43,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:43,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:43,650 INFO L87 Difference]: Start difference. First operand 3466 states and 5273 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03 04:02:43,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:43,837 INFO L93 Difference]: Finished difference Result 5526 states and 8484 transitions. [2021-11-03 04:02:43,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:43,838 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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 60 [2021-11-03 04:02:43,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:43,862 INFO L225 Difference]: With dead ends: 5526 [2021-11-03 04:02:43,863 INFO L226 Difference]: Without dead ends: 3466 [2021-11-03 04:02:43,867 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-03 04:02:43,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3466 states. [2021-11-03 04:02:44,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3466 to 3396. [2021-11-03 04:02:44,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3395 states have (on average 1.4998527245949926) internal successors, (5092), 3395 states have internal predecessors, (5092), 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-03 04:02:44,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5092 transitions. [2021-11-03 04:02:44,129 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5092 transitions. Word has length 60 [2021-11-03 04:02:44,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:44,129 INFO L470 AbstractCegarLoop]: Abstraction has 3396 states and 5092 transitions. [2021-11-03 04:02:44,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 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-03 04:02:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5092 transitions. [2021-11-03 04:02:44,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2021-11-03 04:02:44,138 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:44,138 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:44,138 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 04:02:44,138 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:44,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:44,139 INFO L85 PathProgramCache]: Analyzing trace with hash 1479475964, now seen corresponding path program 1 times [2021-11-03 04:02:44,139 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:44,139 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128067826] [2021-11-03 04:02:44,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:44,140 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:44,194 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:02:44,194 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:44,194 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128067826] [2021-11-03 04:02:44,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128067826] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:44,195 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:44,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:44,195 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898107980] [2021-11-03 04:02:44,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:02:44,196 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:44,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:02:44,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:02:44,197 INFO L87 Difference]: Start difference. First operand 3396 states and 5092 transitions. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-03 04:02:44,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:44,377 INFO L93 Difference]: Finished difference Result 4795 states and 7183 transitions. [2021-11-03 04:02:44,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:02:44,377 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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 60 [2021-11-03 04:02:44,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:44,398 INFO L225 Difference]: With dead ends: 4795 [2021-11-03 04:02:44,399 INFO L226 Difference]: Without dead ends: 3399 [2021-11-03 04:02:44,403 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 04:02:44,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2021-11-03 04:02:44,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3396. [2021-11-03 04:02:44,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 3395 states have (on average 1.4892488954344625) internal successors, (5056), 3395 states have internal predecessors, (5056), 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-03 04:02:44,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 5056 transitions. [2021-11-03 04:02:44,670 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 5056 transitions. Word has length 60 [2021-11-03 04:02:44,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:44,670 INFO L470 AbstractCegarLoop]: Abstraction has 3396 states and 5056 transitions. [2021-11-03 04:02:44,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 3 states have internal predecessors, (57), 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-03 04:02:44,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 5056 transitions. [2021-11-03 04:02:44,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2021-11-03 04:02:44,678 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:44,679 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:44,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 04:02:44,679 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:44,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:44,680 INFO L85 PathProgramCache]: Analyzing trace with hash -842990924, now seen corresponding path program 1 times [2021-11-03 04:02:44,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:44,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594429689] [2021-11-03 04:02:44,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:44,680 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:44,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:44,734 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:02:44,734 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:44,734 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594429689] [2021-11-03 04:02:44,734 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594429689] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:44,734 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:44,735 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:02:44,735 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737019991] [2021-11-03 04:02:44,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:02:44,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:44,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:02:44,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:02:44,736 INFO L87 Difference]: Start difference. First operand 3396 states and 5056 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-03 04:02:45,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:45,067 INFO L93 Difference]: Finished difference Result 6255 states and 9209 transitions. [2021-11-03 04:02:45,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:02:45,068 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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 61 [2021-11-03 04:02:45,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:45,098 INFO L225 Difference]: With dead ends: 6255 [2021-11-03 04:02:45,099 INFO L226 Difference]: Without dead ends: 4859 [2021-11-03 04:02:45,103 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-03 04:02:45,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4859 states. [2021-11-03 04:02:45,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4859 to 3824. [2021-11-03 04:02:45,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3824 states, 3823 states have (on average 1.4546167930944285) internal successors, (5561), 3823 states have internal predecessors, (5561), 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-03 04:02:45,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3824 states to 3824 states and 5561 transitions. [2021-11-03 04:02:45,397 INFO L78 Accepts]: Start accepts. Automaton has 3824 states and 5561 transitions. Word has length 61 [2021-11-03 04:02:45,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:45,398 INFO L470 AbstractCegarLoop]: Abstraction has 3824 states and 5561 transitions. [2021-11-03 04:02:45,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 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-03 04:02:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3824 states and 5561 transitions. [2021-11-03 04:02:45,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2021-11-03 04:02:45,407 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:45,408 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:02:45,408 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 04:02:45,408 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:45,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:45,409 INFO L85 PathProgramCache]: Analyzing trace with hash 915840223, now seen corresponding path program 1 times [2021-11-03 04:02:45,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:45,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444693172] [2021-11-03 04:02:45,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:45,410 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:45,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:45,458 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:02:45,459 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:45,459 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444693172] [2021-11-03 04:02:45,459 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444693172] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:45,460 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:45,460 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:45,460 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946455160] [2021-11-03 04:02:45,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:45,461 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:45,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:45,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:45,462 INFO L87 Difference]: Start difference. First operand 3824 states and 5561 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 04:02:45,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:45,739 INFO L93 Difference]: Finished difference Result 7970 states and 11703 transitions. [2021-11-03 04:02:45,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:45,739 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 62 [2021-11-03 04:02:45,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:45,775 INFO L225 Difference]: With dead ends: 7970 [2021-11-03 04:02:45,775 INFO L226 Difference]: Without dead ends: 4905 [2021-11-03 04:02:45,783 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-03 04:02:45,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4905 states. [2021-11-03 04:02:46,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4905 to 4352. [2021-11-03 04:02:46,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 4351 states have (on average 1.4683980694093313) internal successors, (6389), 4351 states have internal predecessors, (6389), 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-03 04:02:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 6389 transitions. [2021-11-03 04:02:46,089 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 6389 transitions. Word has length 62 [2021-11-03 04:02:46,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:46,089 INFO L470 AbstractCegarLoop]: Abstraction has 4352 states and 6389 transitions. [2021-11-03 04:02:46,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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-03 04:02:46,091 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 6389 transitions. [2021-11-03 04:02:46,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-03 04:02:46,107 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:46,107 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:46,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 04:02:46,108 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:46,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:46,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1649650490, now seen corresponding path program 1 times [2021-11-03 04:02:46,109 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:46,109 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118059361] [2021-11-03 04:02:46,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:46,109 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:46,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2021-11-03 04:02:46,169 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:46,169 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118059361] [2021-11-03 04:02:46,170 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118059361] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:46,170 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:46,170 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:46,170 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [981719841] [2021-11-03 04:02:46,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:46,171 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:46,172 INFO L87 Difference]: Start difference. First operand 4352 states and 6389 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-03 04:02:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:46,416 INFO L93 Difference]: Finished difference Result 8551 states and 12483 transitions. [2021-11-03 04:02:46,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:46,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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 83 [2021-11-03 04:02:46,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:46,430 INFO L225 Difference]: With dead ends: 8551 [2021-11-03 04:02:46,431 INFO L226 Difference]: Without dead ends: 4958 [2021-11-03 04:02:46,438 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-03 04:02:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4958 states. [2021-11-03 04:02:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4958 to 4352. [2021-11-03 04:02:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4352 states, 4351 states have (on average 1.456676626062974) internal successors, (6338), 4351 states have internal predecessors, (6338), 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-03 04:02:46,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4352 states to 4352 states and 6338 transitions. [2021-11-03 04:02:46,693 INFO L78 Accepts]: Start accepts. Automaton has 4352 states and 6338 transitions. Word has length 83 [2021-11-03 04:02:46,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:46,694 INFO L470 AbstractCegarLoop]: Abstraction has 4352 states and 6338 transitions. [2021-11-03 04:02:46,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 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-03 04:02:46,694 INFO L276 IsEmpty]: Start isEmpty. Operand 4352 states and 6338 transitions. [2021-11-03 04:02:46,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-03 04:02:46,704 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:46,704 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:46,704 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 04:02:46,704 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:46,705 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:46,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1671827847, now seen corresponding path program 1 times [2021-11-03 04:02:46,705 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:46,706 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546279587] [2021-11-03 04:02:46,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:46,706 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:46,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:46,765 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:02:46,765 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:46,765 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546279587] [2021-11-03 04:02:46,766 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546279587] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:46,766 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:46,766 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:46,766 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591747813] [2021-11-03 04:02:46,767 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:46,767 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:46,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:46,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:46,768 INFO L87 Difference]: Start difference. First operand 4352 states and 6338 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:47,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:47,140 INFO L93 Difference]: Finished difference Result 11379 states and 16687 transitions. [2021-11-03 04:02:47,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:47,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-03 04:02:47,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:47,160 INFO L225 Difference]: With dead ends: 11379 [2021-11-03 04:02:47,160 INFO L226 Difference]: Without dead ends: 7786 [2021-11-03 04:02:47,167 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-03 04:02:47,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7786 states. [2021-11-03 04:02:47,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7786 to 7461. [2021-11-03 04:02:47,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7461 states, 7460 states have (on average 1.4513404825737266) internal successors, (10827), 7460 states have internal predecessors, (10827), 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-03 04:02:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7461 states to 7461 states and 10827 transitions. [2021-11-03 04:02:47,588 INFO L78 Accepts]: Start accepts. Automaton has 7461 states and 10827 transitions. Word has length 83 [2021-11-03 04:02:47,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:47,589 INFO L470 AbstractCegarLoop]: Abstraction has 7461 states and 10827 transitions. [2021-11-03 04:02:47,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 7461 states and 10827 transitions. [2021-11-03 04:02:47,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-03 04:02:47,605 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:47,605 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:47,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 04:02:47,606 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:47,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:47,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1936393939, now seen corresponding path program 1 times [2021-11-03 04:02:47,607 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:47,607 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327709512] [2021-11-03 04:02:47,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:47,608 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:47,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:47,660 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:02:47,661 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:47,661 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327709512] [2021-11-03 04:02:47,661 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327709512] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:47,661 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:47,662 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:02:47,662 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877539433] [2021-11-03 04:02:47,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:47,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:47,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:47,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:47,664 INFO L87 Difference]: Start difference. First operand 7461 states and 10827 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-03 04:02:48,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:48,228 INFO L93 Difference]: Finished difference Result 21340 states and 30986 transitions. [2021-11-03 04:02:48,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:48,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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 83 [2021-11-03 04:02:48,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:48,272 INFO L225 Difference]: With dead ends: 21340 [2021-11-03 04:02:48,272 INFO L226 Difference]: Without dead ends: 13887 [2021-11-03 04:02:48,287 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-03 04:02:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2021-11-03 04:02:49,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 13763. [2021-11-03 04:02:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13763 states, 13762 states have (on average 1.4380177299811074) internal successors, (19790), 13762 states have internal predecessors, (19790), 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-03 04:02:49,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13763 states to 13763 states and 19790 transitions. [2021-11-03 04:02:49,068 INFO L78 Accepts]: Start accepts. Automaton has 13763 states and 19790 transitions. Word has length 83 [2021-11-03 04:02:49,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:49,068 INFO L470 AbstractCegarLoop]: Abstraction has 13763 states and 19790 transitions. [2021-11-03 04:02:49,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 2 states have internal predecessors, (77), 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-03 04:02:49,069 INFO L276 IsEmpty]: Start isEmpty. Operand 13763 states and 19790 transitions. [2021-11-03 04:02:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-11-03 04:02:49,093 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:49,093 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:49,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 04:02:49,094 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:49,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1132087261, now seen corresponding path program 1 times [2021-11-03 04:02:49,096 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:49,096 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797452570] [2021-11-03 04:02:49,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:49,097 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:49,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:49,144 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-03 04:02:49,144 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:49,144 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797452570] [2021-11-03 04:02:49,145 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797452570] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:49,145 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:49,145 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:49,145 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243499331] [2021-11-03 04:02:49,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:49,146 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:49,147 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:49,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:49,147 INFO L87 Difference]: Start difference. First operand 13763 states and 19790 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:49,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:49,879 INFO L93 Difference]: Finished difference Result 25799 states and 37560 transitions. [2021-11-03 04:02:49,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:49,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 83 [2021-11-03 04:02:49,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:49,926 INFO L225 Difference]: With dead ends: 25799 [2021-11-03 04:02:49,926 INFO L226 Difference]: Without dead ends: 16509 [2021-11-03 04:02:49,946 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-03 04:02:49,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16509 states. [2021-11-03 04:02:50,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16509 to 15951. [2021-11-03 04:02:50,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15951 states, 15950 states have (on average 1.453667711598746) internal successors, (23186), 15950 states have internal predecessors, (23186), 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-03 04:02:50,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 23186 transitions. [2021-11-03 04:02:50,863 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 23186 transitions. Word has length 83 [2021-11-03 04:02:50,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:50,864 INFO L470 AbstractCegarLoop]: Abstraction has 15951 states and 23186 transitions. [2021-11-03 04:02:50,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:50,865 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 23186 transitions. [2021-11-03 04:02:50,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-11-03 04:02:50,897 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:50,897 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:50,898 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 04:02:50,898 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:50,898 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:50,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1386430113, now seen corresponding path program 1 times [2021-11-03 04:02:50,899 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:50,899 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585341562] [2021-11-03 04:02:50,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:50,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:50,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:50,983 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-11-03 04:02:50,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:50,986 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585341562] [2021-11-03 04:02:50,989 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585341562] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:50,989 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:50,989 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:50,990 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847005308] [2021-11-03 04:02:50,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:02:50,990 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:50,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:02:50,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:02:50,992 INFO L87 Difference]: Start difference. First operand 15951 states and 23186 transitions. Second operand has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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-03 04:02:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:51,681 INFO L93 Difference]: Finished difference Result 30443 states and 44289 transitions. [2021-11-03 04:02:51,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:02:51,682 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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 84 [2021-11-03 04:02:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:51,738 INFO L225 Difference]: With dead ends: 30443 [2021-11-03 04:02:51,738 INFO L226 Difference]: Without dead ends: 16035 [2021-11-03 04:02:51,765 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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-03 04:02:51,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16035 states. [2021-11-03 04:02:52,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16035 to 15951. [2021-11-03 04:02:52,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15951 states, 15950 states have (on average 1.4450156739811912) internal successors, (23048), 15950 states have internal predecessors, (23048), 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-03 04:02:52,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15951 states to 15951 states and 23048 transitions. [2021-11-03 04:02:52,667 INFO L78 Accepts]: Start accepts. Automaton has 15951 states and 23048 transitions. Word has length 84 [2021-11-03 04:02:52,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:52,668 INFO L470 AbstractCegarLoop]: Abstraction has 15951 states and 23048 transitions. [2021-11-03 04:02:52,668 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 20.25) internal successors, (81), 3 states have internal predecessors, (81), 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-03 04:02:52,668 INFO L276 IsEmpty]: Start isEmpty. Operand 15951 states and 23048 transitions. [2021-11-03 04:02:52,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2021-11-03 04:02:52,695 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:52,695 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:52,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 04:02:52,696 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:52,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2048541769, now seen corresponding path program 1 times [2021-11-03 04:02:52,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:52,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351763406] [2021-11-03 04:02:52,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:52,697 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:52,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:52,741 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:02:52,741 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:52,741 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351763406] [2021-11-03 04:02:52,741 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351763406] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:52,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:52,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:52,742 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603470627] [2021-11-03 04:02:52,742 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:52,742 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:52,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:52,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:52,743 INFO L87 Difference]: Start difference. First operand 15951 states and 23048 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-03 04:02:53,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:53,278 INFO L93 Difference]: Finished difference Result 26948 states and 38975 transitions. [2021-11-03 04:02:53,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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 85 [2021-11-03 04:02:53,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:53,316 INFO L225 Difference]: With dead ends: 26948 [2021-11-03 04:02:53,316 INFO L226 Difference]: Without dead ends: 12540 [2021-11-03 04:02:53,336 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-03 04:02:53,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12540 states. [2021-11-03 04:02:53,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12540 to 12204. [2021-11-03 04:02:53,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12204 states, 12203 states have (on average 1.4109645169220684) internal successors, (17218), 12203 states have internal predecessors, (17218), 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-03 04:02:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12204 states to 12204 states and 17218 transitions. [2021-11-03 04:02:53,935 INFO L78 Accepts]: Start accepts. Automaton has 12204 states and 17218 transitions. Word has length 85 [2021-11-03 04:02:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:53,935 INFO L470 AbstractCegarLoop]: Abstraction has 12204 states and 17218 transitions. [2021-11-03 04:02:53,935 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 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-03 04:02:53,936 INFO L276 IsEmpty]: Start isEmpty. Operand 12204 states and 17218 transitions. [2021-11-03 04:02:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-11-03 04:02:53,954 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:53,954 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:53,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 04:02:53,955 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:53,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:53,956 INFO L85 PathProgramCache]: Analyzing trace with hash -204040586, now seen corresponding path program 1 times [2021-11-03 04:02:53,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:53,956 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051482909] [2021-11-03 04:02:53,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:53,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:53,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:54,083 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2021-11-03 04:02:54,083 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:54,084 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051482909] [2021-11-03 04:02:54,084 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051482909] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:54,086 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:54,086 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:02:54,086 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546795713] [2021-11-03 04:02:54,087 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:54,087 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:54,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:54,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:54,090 INFO L87 Difference]: Start difference. First operand 12204 states and 17218 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-03 04:02:55,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:55,026 INFO L93 Difference]: Finished difference Result 25642 states and 35812 transitions. [2021-11-03 04:02:55,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:55,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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 86 [2021-11-03 04:02:55,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:55,056 INFO L225 Difference]: With dead ends: 25642 [2021-11-03 04:02:55,057 INFO L226 Difference]: Without dead ends: 13454 [2021-11-03 04:02:55,070 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:55,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13454 states. [2021-11-03 04:02:55,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13454 to 13450. [2021-11-03 04:02:55,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13450 states, 13449 states have (on average 1.3644880660272138) internal successors, (18351), 13449 states have internal predecessors, (18351), 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-03 04:02:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13450 states to 13450 states and 18351 transitions. [2021-11-03 04:02:55,822 INFO L78 Accepts]: Start accepts. Automaton has 13450 states and 18351 transitions. Word has length 86 [2021-11-03 04:02:55,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:55,822 INFO L470 AbstractCegarLoop]: Abstraction has 13450 states and 18351 transitions. [2021-11-03 04:02:55,822 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 2 states have internal predecessors, (81), 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-03 04:02:55,823 INFO L276 IsEmpty]: Start isEmpty. Operand 13450 states and 18351 transitions. [2021-11-03 04:02:55,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-11-03 04:02:55,838 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:55,838 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:55,839 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 04:02:55,839 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:55,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:55,839 INFO L85 PathProgramCache]: Analyzing trace with hash 419493126, now seen corresponding path program 1 times [2021-11-03 04:02:55,840 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:55,840 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584061268] [2021-11-03 04:02:55,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:55,840 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:55,927 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-03 04:02:55,927 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:55,927 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584061268] [2021-11-03 04:02:55,927 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584061268] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:55,928 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:55,928 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:02:55,928 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834795289] [2021-11-03 04:02:55,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:02:55,930 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:02:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:02:55,931 INFO L87 Difference]: Start difference. First operand 13450 states and 18351 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-03 04:02:56,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:56,981 INFO L93 Difference]: Finished difference Result 27015 states and 36982 transitions. [2021-11-03 04:02:56,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:02:56,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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 88 [2021-11-03 04:02:56,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:57,022 INFO L225 Difference]: With dead ends: 27015 [2021-11-03 04:02:57,022 INFO L226 Difference]: Without dead ends: 17624 [2021-11-03 04:02:57,038 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-03 04:02:57,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17624 states. [2021-11-03 04:02:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17624 to 14286. [2021-11-03 04:02:57,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14286 states, 14285 states have (on average 1.3406370318515926) internal successors, (19151), 14285 states have internal predecessors, (19151), 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-03 04:02:57,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14286 states to 14286 states and 19151 transitions. [2021-11-03 04:02:57,958 INFO L78 Accepts]: Start accepts. Automaton has 14286 states and 19151 transitions. Word has length 88 [2021-11-03 04:02:57,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:57,959 INFO L470 AbstractCegarLoop]: Abstraction has 14286 states and 19151 transitions. [2021-11-03 04:02:57,959 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 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-03 04:02:57,959 INFO L276 IsEmpty]: Start isEmpty. Operand 14286 states and 19151 transitions. [2021-11-03 04:02:57,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-03 04:02:57,975 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:57,976 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:57,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 04:02:57,976 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:57,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:57,977 INFO L85 PathProgramCache]: Analyzing trace with hash -493269631, now seen corresponding path program 1 times [2021-11-03 04:02:57,977 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:57,978 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484208896] [2021-11-03 04:02:57,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:57,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:02:58,030 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:58,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484208896] [2021-11-03 04:02:58,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484208896] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:58,031 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:58,031 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:02:58,031 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095326564] [2021-11-03 04:02:58,032 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:58,032 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:58,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:58,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:58,034 INFO L87 Difference]: Start difference. First operand 14286 states and 19151 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:58,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:02:58,991 INFO L93 Difference]: Finished difference Result 26218 states and 35314 transitions. [2021-11-03 04:02:58,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:02:58,991 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2021-11-03 04:02:58,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:02:59,018 INFO L225 Difference]: With dead ends: 26218 [2021-11-03 04:02:59,019 INFO L226 Difference]: Without dead ends: 14270 [2021-11-03 04:02:59,035 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-03 04:02:59,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14270 states. [2021-11-03 04:02:59,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14270 to 14086. [2021-11-03 04:02:59,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14086 states, 14085 states have (on average 1.3020234291799786) internal successors, (18339), 14085 states have internal predecessors, (18339), 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-03 04:02:59,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 18339 transitions. [2021-11-03 04:02:59,793 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 18339 transitions. Word has length 110 [2021-11-03 04:02:59,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:02:59,794 INFO L470 AbstractCegarLoop]: Abstraction has 14086 states and 18339 transitions. [2021-11-03 04:02:59,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:02:59,794 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 18339 transitions. [2021-11-03 04:02:59,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2021-11-03 04:02:59,806 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:02:59,807 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:02:59,807 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-11-03 04:02:59,807 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:02:59,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:02:59,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2048164705, now seen corresponding path program 1 times [2021-11-03 04:02:59,808 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:02:59,808 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310010815] [2021-11-03 04:02:59,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:02:59,809 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:02:59,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:02:59,855 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-03 04:02:59,856 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:02:59,856 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310010815] [2021-11-03 04:02:59,856 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310010815] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:02:59,856 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:02:59,856 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 04:02:59,857 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553147195] [2021-11-03 04:02:59,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:02:59,857 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:02:59,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:02:59,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:02:59,858 INFO L87 Difference]: Start difference. First operand 14086 states and 18339 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-03 04:03:00,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:03:00,479 INFO L93 Difference]: Finished difference Result 25794 states and 33666 transitions. [2021-11-03 04:03:00,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:03:00,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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 110 [2021-11-03 04:03:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:03:00,503 INFO L225 Difference]: With dead ends: 25794 [2021-11-03 04:03:00,504 INFO L226 Difference]: Without dead ends: 14086 [2021-11-03 04:03:00,514 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-03 04:03:00,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14086 states. [2021-11-03 04:03:01,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14086 to 14086. [2021-11-03 04:03:01,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14086 states, 14085 states have (on average 1.2790202342917998) internal successors, (18015), 14085 states have internal predecessors, (18015), 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-03 04:03:01,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14086 states to 14086 states and 18015 transitions. [2021-11-03 04:03:01,122 INFO L78 Accepts]: Start accepts. Automaton has 14086 states and 18015 transitions. Word has length 110 [2021-11-03 04:03:01,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:03:01,122 INFO L470 AbstractCegarLoop]: Abstraction has 14086 states and 18015 transitions. [2021-11-03 04:03:01,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 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-03 04:03:01,122 INFO L276 IsEmpty]: Start isEmpty. Operand 14086 states and 18015 transitions. [2021-11-03 04:03:01,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-11-03 04:03:01,135 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:03:01,136 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:03:01,136 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-11-03 04:03:01,136 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:03:01,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:03:01,137 INFO L85 PathProgramCache]: Analyzing trace with hash 310856231, now seen corresponding path program 1 times [2021-11-03 04:03:01,137 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:03:01,138 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747632956] [2021-11-03 04:03:01,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:03:01,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:03:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:03:01,204 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:03:01,204 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:03:01,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747632956] [2021-11-03 04:03:01,205 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747632956] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:03:01,205 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:03:01,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:03:01,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100862196] [2021-11-03 04:03:01,206 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:03:01,206 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:03:01,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:03:01,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:03:01,207 INFO L87 Difference]: Start difference. First operand 14086 states and 18015 transitions. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:03:02,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:03:02,008 INFO L93 Difference]: Finished difference Result 29374 states and 38298 transitions. [2021-11-03 04:03:02,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:03:02,011 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2021-11-03 04:03:02,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:03:02,039 INFO L225 Difference]: With dead ends: 29374 [2021-11-03 04:03:02,039 INFO L226 Difference]: Without dead ends: 17666 [2021-11-03 04:03:02,056 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-03 04:03:02,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17666 states. [2021-11-03 04:03:02,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17666 to 14782. [2021-11-03 04:03:02,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14782 states, 14781 states have (on average 1.2875312901698126) internal successors, (19031), 14781 states have internal predecessors, (19031), 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-03 04:03:02,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14782 states to 14782 states and 19031 transitions. [2021-11-03 04:03:02,789 INFO L78 Accepts]: Start accepts. Automaton has 14782 states and 19031 transitions. Word has length 113 [2021-11-03 04:03:02,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:03:02,790 INFO L470 AbstractCegarLoop]: Abstraction has 14782 states and 19031 transitions. [2021-11-03 04:03:02,790 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 04:03:02,790 INFO L276 IsEmpty]: Start isEmpty. Operand 14782 states and 19031 transitions. [2021-11-03 04:03:02,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-03 04:03:02,807 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:03:02,808 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:03:02,808 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-11-03 04:03:02,808 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:03:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:03:02,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1867357665, now seen corresponding path program 1 times [2021-11-03 04:03:02,809 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:03:02,809 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861807444] [2021-11-03 04:03:02,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:03:02,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:03:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:03:02,860 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 04:03:02,860 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:03:02,861 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861807444] [2021-11-03 04:03:02,861 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861807444] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:03:02,861 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:03:02,861 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-11-03 04:03:02,861 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203992449] [2021-11-03 04:03:02,862 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 04:03:02,862 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:03:02,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 04:03:02,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 04:03:02,863 INFO L87 Difference]: Start difference. First operand 14782 states and 19031 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-03 04:03:03,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:03:03,517 INFO L93 Difference]: Finished difference Result 28172 states and 36374 transitions. [2021-11-03 04:03:03,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 04:03:03,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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 135 [2021-11-03 04:03:03,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:03:03,541 INFO L225 Difference]: With dead ends: 28172 [2021-11-03 04:03:03,541 INFO L226 Difference]: Without dead ends: 14710 [2021-11-03 04:03:03,555 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-03 04:03:03,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14710 states. [2021-11-03 04:03:04,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14710 to 14518. [2021-11-03 04:03:04,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14518 states, 14517 states have (on average 1.243989805056141) internal successors, (18059), 14517 states have internal predecessors, (18059), 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-03 04:03:04,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14518 states to 14518 states and 18059 transitions. [2021-11-03 04:03:04,135 INFO L78 Accepts]: Start accepts. Automaton has 14518 states and 18059 transitions. Word has length 135 [2021-11-03 04:03:04,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:03:04,135 INFO L470 AbstractCegarLoop]: Abstraction has 14518 states and 18059 transitions. [2021-11-03 04:03:04,135 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 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-03 04:03:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 14518 states and 18059 transitions. [2021-11-03 04:03:04,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2021-11-03 04:03:04,145 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:03:04,145 INFO L513 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:03:04,145 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-11-03 04:03:04,146 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:03:04,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:03:04,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1533946912, now seen corresponding path program 1 times [2021-11-03 04:03:04,147 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:03:04,147 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916502508] [2021-11-03 04:03:04,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:03:04,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:03:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 04:03:04,210 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 04:03:04,211 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 04:03:04,211 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916502508] [2021-11-03 04:03:04,211 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916502508] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 04:03:04,211 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 04:03:04,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 04:03:04,212 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943017112] [2021-11-03 04:03:04,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 04:03:04,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 04:03:04,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 04:03:04,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 04:03:04,213 INFO L87 Difference]: Start difference. First operand 14518 states and 18059 transitions. Second operand has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-03 04:03:04,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 04:03:04,989 INFO L93 Difference]: Finished difference Result 27644 states and 34446 transitions. [2021-11-03 04:03:04,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 04:03:04,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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 135 [2021-11-03 04:03:04,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 04:03:05,010 INFO L225 Difference]: With dead ends: 27644 [2021-11-03 04:03:05,010 INFO L226 Difference]: Without dead ends: 14462 [2021-11-03 04:03:05,022 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-03 04:03:05,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14462 states. [2021-11-03 04:03:05,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14462 to 14462. [2021-11-03 04:03:05,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14462 states, 14461 states have (on average 1.2169974413940945) internal successors, (17599), 14461 states have internal predecessors, (17599), 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-03 04:03:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14462 states to 14462 states and 17599 transitions. [2021-11-03 04:03:05,717 INFO L78 Accepts]: Start accepts. Automaton has 14462 states and 17599 transitions. Word has length 135 [2021-11-03 04:03:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 04:03:05,718 INFO L470 AbstractCegarLoop]: Abstraction has 14462 states and 17599 transitions. [2021-11-03 04:03:05,718 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.5) internal successors, (134), 4 states have internal predecessors, (134), 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-03 04:03:05,718 INFO L276 IsEmpty]: Start isEmpty. Operand 14462 states and 17599 transitions. [2021-11-03 04:03:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-11-03 04:03:05,728 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 04:03:05,728 INFO L513 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 04:03:05,728 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2021-11-03 04:03:05,729 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-11-03 04:03:05,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 04:03:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash -1392067570, now seen corresponding path program 1 times [2021-11-03 04:03:05,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 04:03:05,729 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53969219] [2021-11-03 04:03:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 04:03:05,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 04:03:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:03:05,768 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 04:03:05,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 04:03:05,934 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 04:03:05,934 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 04:03:05,935 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-11-03 04:03:05,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2021-11-03 04:03:05,941 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 04:03:05,946 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 04:03:06,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 04:03:06 BoogieIcfgContainer [2021-11-03 04:03:06,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 04:03:06,187 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 04:03:06,187 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 04:03:06,187 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 04:03:06,188 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 04:02:40" (3/4) ... [2021-11-03 04:03:06,191 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 04:03:06,418 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 04:03:06,418 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 04:03:06,420 INFO L168 Benchmark]: Toolchain (without parser) took 29488.23 ms. Allocated memory was 88.1 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 54.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 677.9 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,420 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 88.1 MB. Free memory is still 44.3 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 04:03:06,421 INFO L168 Benchmark]: CACSL2BoogieTranslator took 417.35 ms. Allocated memory is still 88.1 MB. Free memory was 54.5 MB in the beginning and 60.3 MB in the end (delta: -5.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,422 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 88.1 MB. Free memory was 60.3 MB in the beginning and 56.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,422 INFO L168 Benchmark]: Boogie Preprocessor took 99.53 ms. Allocated memory is still 88.1 MB. Free memory was 56.1 MB in the beginning and 52.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,423 INFO L168 Benchmark]: RCFGBuilder took 2578.24 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 52.5 MB in the beginning and 60.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,423 INFO L168 Benchmark]: TraceAbstraction took 26081.84 ms. Allocated memory was 117.4 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 60.1 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 623.7 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,423 INFO L168 Benchmark]: Witness Printer took 231.10 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 30.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-11-03 04:03:06,426 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27 ms. Allocated memory is still 88.1 MB. Free memory is still 44.3 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 417.35 ms. Allocated memory is still 88.1 MB. Free memory was 54.5 MB in the beginning and 60.3 MB in the end (delta: -5.7 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 71.96 ms. Allocated memory is still 88.1 MB. Free memory was 60.3 MB in the beginning and 56.1 MB in the end (delta: 4.2 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 99.53 ms. Allocated memory is still 88.1 MB. Free memory was 56.1 MB in the beginning and 52.5 MB in the end (delta: 3.6 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * RCFGBuilder took 2578.24 ms. Allocated memory was 88.1 MB in the beginning and 117.4 MB in the end (delta: 29.4 MB). Free memory was 52.5 MB in the beginning and 60.1 MB in the end (delta: -7.5 MB). Peak memory consumption was 46.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 26081.84 ms. Allocated memory was 117.4 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 60.1 MB in the beginning and 1.9 GB in the end (delta: -1.9 GB). Peak memory consumption was 623.7 MB. Max. memory is 16.1 GB. * Witness Printer took 231.10 ms. Allocated memory is still 2.6 GB. Free memory was 1.9 GB in the beginning and 1.9 GB in the end (delta: 30.4 MB). Peak memory consumption was 29.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: 13]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L17] int m_pc = 0; [L18] int t1_pc = 0; [L19] int t2_pc = 0; [L20] int t3_pc = 0; [L21] int t4_pc = 0; [L22] int m_st ; [L23] int t1_st ; [L24] int t2_st ; [L25] int t3_st ; [L26] int t4_st ; [L27] int m_i ; [L28] int t1_i ; [L29] int t2_i ; [L30] int t3_i ; [L31] int t4_i ; [L32] int M_E = 2; [L33] int T1_E = 2; [L34] int T2_E = 2; [L35] int T3_E = 2; [L36] int T4_E = 2; [L37] int E_1 = 2; [L38] int E_2 = 2; [L39] int E_3 = 2; [L40] int E_4 = 2; [L813] int __retres1 ; [L725] m_i = 1 [L726] t1_i = 1 [L727] t2_i = 1 [L728] t3_i = 1 [L729] t4_i = 1 [L754] int kernel_st ; [L755] int tmp ; [L756] int tmp___0 ; [L760] kernel_st = 0 [L333] COND TRUE m_i == 1 [L334] m_st = 0 [L338] COND TRUE t1_i == 1 [L339] t1_st = 0 [L343] COND TRUE t2_i == 1 [L344] t2_st = 0 [L348] COND TRUE t3_i == 1 [L349] t3_st = 0 [L353] COND TRUE t4_i == 1 [L354] t4_st = 0 [L494] COND FALSE !(M_E == 0) [L499] COND FALSE !(T1_E == 0) [L504] COND FALSE !(T2_E == 0) [L509] COND FALSE !(T3_E == 0) [L514] COND FALSE !(T4_E == 0) [L519] COND FALSE !(E_1 == 0) [L524] COND FALSE !(E_2 == 0) [L529] COND FALSE !(E_3 == 0) [L534] COND FALSE !(E_4 == 0) [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L230] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L249] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L268] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L287] COND FALSE !(t3_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L297] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L306] COND FALSE !(t4_pc == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L316] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L547] COND FALSE !(M_E == 1) [L552] COND FALSE !(T1_E == 1) [L557] COND FALSE !(T2_E == 1) [L562] COND FALSE !(T3_E == 1) [L567] COND FALSE !(T4_E == 1) [L572] COND FALSE !(E_1 == 1) [L577] COND FALSE !(E_2 == 1) [L582] COND FALSE !(E_3 == 1) [L587] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L768] COND TRUE 1 [L771] kernel_st = 1 [L399] int tmp ; VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L403] COND TRUE 1 [L363] int __retres1 ; [L366] COND TRUE m_st == 0 [L367] __retres1 = 1 [L394] return (__retres1); [L406] tmp = exists_runnable_thread() [L408] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L413] COND TRUE m_st == 0 [L414] int tmp_ndt_1; [L415] tmp_ndt_1 = __VERIFIER_nondet_int() [L416] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L427] COND TRUE t1_st == 0 [L428] int tmp_ndt_2; [L429] tmp_ndt_2 = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp_ndt_2) [L432] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L92] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L103] COND TRUE 1 [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L441] COND TRUE t2_st == 0 [L442] int tmp_ndt_3; [L443] tmp_ndt_3 = __VERIFIER_nondet_int() [L444] COND TRUE \read(tmp_ndt_3) [L446] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L127] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L138] COND TRUE 1 [L140] t2_pc = 1 [L141] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=0, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L455] COND TRUE t3_st == 0 [L456] int tmp_ndt_4; [L457] tmp_ndt_4 = __VERIFIER_nondet_int() [L458] COND TRUE \read(tmp_ndt_4) [L460] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L162] COND TRUE t3_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=0, t3_st=1, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L173] COND TRUE 1 [L175] t3_pc = 1 [L176] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=0] [L469] COND TRUE t4_st == 0 [L470] int tmp_ndt_5; [L471] tmp_ndt_5 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp_ndt_5) [L474] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1] [L197] COND TRUE t4_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=0, t4_st=1] [L208] COND TRUE 1 [L210] t4_pc = 1 [L211] t4_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L403] COND TRUE 1 [L363] int __retres1 ; [L366] COND TRUE m_st == 0 [L367] __retres1 = 1 [L394] return (__retres1); [L406] tmp = exists_runnable_thread() [L408] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L413] COND TRUE m_st == 0 [L414] int tmp_ndt_1; [L415] tmp_ndt_1 = __VERIFIER_nondet_int() [L416] COND TRUE \read(tmp_ndt_1) [L418] m_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L51] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L62] COND TRUE 1 [L65] E_1 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L230] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L240] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L249] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L250] COND TRUE E_1 == 1 [L251] __retres1 = 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND TRUE \read(tmp___0) [L616] t1_st = 0 [L265] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L268] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L269] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L278] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L287] COND TRUE t3_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L288] COND FALSE !(E_3 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L297] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L306] COND TRUE t4_pc == 1 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L307] COND FALSE !(E_4 == 1) VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L316] __retres1 = 0 VAL [E_1=1, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L67] E_1 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L70] COND TRUE 1 [L72] m_pc = 1 [L73] m_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L427] COND TRUE t1_st == 0 [L428] int tmp_ndt_2; [L429] tmp_ndt_2 = __VERIFIER_nondet_int() [L430] COND TRUE \read(tmp_ndt_2) [L432] t1_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L92] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L95] COND TRUE t1_pc == 1 [L111] E_2 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L240] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L259] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L269] COND TRUE E_2 == 1 [L270] __retres1 = 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND TRUE \read(tmp___1) [L624] t2_st = 0 [L284] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L288] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L297] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L307] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L316] __retres1 = 0 VAL [E_1=2, E_2=1, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L113] E_2 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L103] COND TRUE 1 [L105] t1_pc = 1 [L106] t1_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L441] COND TRUE t2_st == 0 [L442] int tmp_ndt_3; [L443] tmp_ndt_3 = __VERIFIER_nondet_int() [L444] COND TRUE \read(tmp_ndt_3) [L446] t2_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L127] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L130] COND TRUE t2_pc == 1 [L146] E_3 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L269] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L288] COND TRUE E_3 == 1 [L289] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND TRUE \read(tmp___2) [L632] t3_st = 0 [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L307] COND FALSE !(E_4 == 1) VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L316] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=1, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND FALSE !(\read(tmp___3)) [L148] E_3 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L138] COND TRUE 1 [L140] t2_pc = 1 [L141] t2_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=0, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L455] COND TRUE t3_st == 0 [L456] int tmp_ndt_4; [L457] tmp_ndt_4 = __VERIFIER_nondet_int() [L458] COND TRUE \read(tmp_ndt_4) [L460] t3_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L162] COND FALSE !(t3_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L165] COND TRUE t3_pc == 1 [L181] E_4 = 1 [L597] int tmp ; [L598] int tmp___0 ; [L599] int tmp___1 ; [L600] int tmp___2 ; [L601] int tmp___3 ; [L227] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L230] COND TRUE m_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L231] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L240] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L242] return (__retres1); [L605] tmp = is_master_triggered() [L607] COND FALSE !(\read(tmp)) [L246] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L249] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L250] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L259] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L261] return (__retres1); [L613] tmp___0 = is_transmit1_triggered() [L615] COND FALSE !(\read(tmp___0)) [L265] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L268] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L269] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L278] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L280] return (__retres1); [L621] tmp___1 = is_transmit2_triggered() [L623] COND FALSE !(\read(tmp___1)) [L284] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L287] COND TRUE t3_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L288] COND FALSE !(E_3 == 1) VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L297] __retres1 = 0 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L299] return (__retres1); [L629] tmp___2 = is_transmit3_triggered() [L631] COND FALSE !(\read(tmp___2)) [L303] int __retres1 ; VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L306] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L307] COND TRUE E_4 == 1 [L308] __retres1 = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=2] [L318] return (__retres1); [L637] tmp___3 = is_transmit4_triggered() [L639] COND TRUE \read(tmp___3) [L640] t4_st = 0 [L183] E_4 = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=1, T4_E=2, t4_i=1, t4_pc=1, t4_st=0] [L173] COND TRUE 1 [L175] t3_pc = 1 [L176] t3_st = 2 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=0] [L469] COND TRUE t4_st == 0 [L470] int tmp_ndt_5; [L471] tmp_ndt_5 = __VERIFIER_nondet_int() [L472] COND TRUE \read(tmp_ndt_5) [L474] t4_st = 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1] [L197] COND FALSE !(t4_pc == 0) VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1] [L200] COND TRUE t4_pc == 1 VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1] [L13] reach_error() VAL [E_1=2, E_2=2, E_3=2, E_4=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2, T3_E=2, t3_i=1, t3_pc=1, t3_st=2, T4_E=2, t4_i=1, t4_pc=1, t4_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 178 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 25.7s, OverallIterations: 25, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 12.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 7794 SDtfs, 5510 SDslu, 5255 SDs, 0 SdLazy, 608 SolverSat, 221 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15951occurred in iteration=15, InterpolantAutomatonStates: 80, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 10.8s AutomataMinimizationTime, 24 MinimizatonAttempts, 12013 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 1931 NumberOfCodeBlocks, 1931 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1768 ConstructedInterpolants, 0 QuantifiedInterpolants, 3235 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 24 InterpolantComputations, 24 PerfectInterpolantSequences, 287/287 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-03 04:03:06,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_ef80a2cf-1389-47b7-b9e4-e98027cb94d6/bin/utaipan-aC7eJsxGYH/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