./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/config/TaipanReach.xml -i ../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI --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 02b1c265b98bd14cc97fe77543b4e06699576e2091fa3d4102d013e6b3937418 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-03 02:23:06,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-03 02:23:06,959 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-03 02:23:06,987 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-03 02:23:06,987 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-03 02:23:06,989 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-03 02:23:06,990 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-03 02:23:06,992 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-03 02:23:06,994 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-03 02:23:06,995 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-03 02:23:06,996 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-03 02:23:06,997 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-03 02:23:06,998 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-03 02:23:07,000 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-03 02:23:07,002 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-03 02:23:07,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-03 02:23:07,007 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-03 02:23:07,011 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-03 02:23:07,013 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-03 02:23:07,016 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-03 02:23:07,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-03 02:23:07,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-03 02:23:07,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-03 02:23:07,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-03 02:23:07,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-03 02:23:07,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-03 02:23:07,029 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-03 02:23:07,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-03 02:23:07,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-03 02:23:07,032 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-03 02:23:07,032 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-03 02:23:07,033 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-03 02:23:07,034 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-03 02:23:07,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-03 02:23:07,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-03 02:23:07,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-03 02:23:07,037 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-03 02:23:07,038 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-03 02:23:07,038 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-03 02:23:07,039 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-03 02:23:07,040 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-03 02:23:07,041 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-03 02:23:07,069 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-03 02:23:07,070 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-03 02:23:07,070 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-03 02:23:07,070 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-03 02:23:07,071 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-03 02:23:07,071 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-03 02:23:07,072 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-03 02:23:07,072 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-03 02:23:07,072 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-03 02:23:07,072 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-03 02:23:07,073 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-03 02:23:07,073 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-03 02:23:07,073 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-03 02:23:07,073 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-03 02:23:07,074 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-03 02:23:07,074 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-03 02:23:07,074 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-03 02:23:07,074 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-03 02:23:07,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-03 02:23:07,076 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-03 02:23:07,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-03 02:23:07,076 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-03 02:23:07,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-03 02:23:07,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-03 02:23:07,077 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-03 02:23:07,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-03 02:23:07,077 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-03 02:23:07,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-03 02:23:07,078 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-03 02:23:07,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-03 02:23:07,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-03 02:23:07,078 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-03 02:23:07,079 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:23:07,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-03 02:23:07,079 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-03 02:23:07,079 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-03 02:23:07,080 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-03 02:23:07,080 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-03 02:23:07,080 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-03 02:23:07,080 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-03 02:23:07,081 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-03 02:23:07,081 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/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_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI 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 -> 02b1c265b98bd14cc97fe77543b4e06699576e2091fa3d4102d013e6b3937418 [2022-11-03 02:23:07,365 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-03 02:23:07,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-03 02:23:07,407 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-03 02:23:07,409 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-03 02:23:07,410 INFO L275 PluginConnector]: CDTParser initialized [2022-11-03 02:23:07,411 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/../../sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2022-11-03 02:23:07,513 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/data/518b218e2/788bb2b9e68d479b8b19c03bef7931a4/FLAGe1f657cca [2022-11-03 02:23:08,173 INFO L306 CDTParser]: Found 1 translation units. [2022-11-03 02:23:08,174 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i [2022-11-03 02:23:08,197 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/data/518b218e2/788bb2b9e68d479b8b19c03bef7931a4/FLAGe1f657cca [2022-11-03 02:23:08,397 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/data/518b218e2/788bb2b9e68d479b8b19c03bef7931a4 [2022-11-03 02:23:08,402 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-03 02:23:08,406 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-03 02:23:08,409 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-03 02:23:08,410 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-03 02:23:08,413 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-03 02:23:08,414 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:23:08" (1/1) ... [2022-11-03 02:23:08,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c86f52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:08, skipping insertion in model container [2022-11-03 02:23:08,417 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 02:23:08" (1/1) ... [2022-11-03 02:23:08,425 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-03 02:23:08,510 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-03 02:23:08,747 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:23:09,346 WARN L230 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_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[75009,75022] [2022-11-03 02:23:09,399 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:23:09,411 INFO L203 MainTranslator]: Completed pre-run [2022-11-03 02:23:09,426 WARN L611 FunctionHandler]: implicit declaration of function __builtin_bswap16 [2022-11-03 02:23:09,481 WARN L230 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_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/sv-benchmarks/c/ldv-races/race-3_2-container_of-global.i[75009,75022] [2022-11-03 02:23:09,511 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-03 02:23:09,641 INFO L208 MainTranslator]: Completed translation [2022-11-03 02:23:09,642 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09 WrapperNode [2022-11-03 02:23:09,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-03 02:23:09,644 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-03 02:23:09,644 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-03 02:23:09,644 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-03 02:23:09,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,706 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,740 INFO L138 Inliner]: procedures = 468, calls = 52, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 134 [2022-11-03 02:23:09,741 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-03 02:23:09,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-03 02:23:09,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-03 02:23:09,742 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-03 02:23:09,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,768 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,771 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,775 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,783 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-03 02:23:09,784 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-03 02:23:09,784 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-03 02:23:09,784 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-03 02:23:09,785 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (1/1) ... [2022-11-03 02:23:09,806 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-03 02:23:09,823 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/z3 [2022-11-03 02:23:09,835 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-03 02:23:09,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-03 02:23:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-03 02:23:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-03 02:23:09,883 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-03 02:23:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-03 02:23:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-03 02:23:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-03 02:23:09,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-03 02:23:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-03 02:23:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2022-11-03 02:23:09,885 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2022-11-03 02:23:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-03 02:23:09,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-03 02:23:09,886 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-03 02:23:09,887 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-03 02:23:10,267 INFO L235 CfgBuilder]: Building ICFG [2022-11-03 02:23:10,269 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-03 02:23:10,613 INFO L276 CfgBuilder]: Performing block encoding [2022-11-03 02:23:10,634 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-03 02:23:10,634 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-03 02:23:10,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:23:10 BoogieIcfgContainer [2022-11-03 02:23:10,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-03 02:23:10,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-03 02:23:10,640 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-03 02:23:10,646 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-03 02:23:10,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 02:23:08" (1/3) ... [2022-11-03 02:23:10,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1628a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:23:10, skipping insertion in model container [2022-11-03 02:23:10,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 02:23:09" (2/3) ... [2022-11-03 02:23:10,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1628a47b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 02:23:10, skipping insertion in model container [2022-11-03 02:23:10,648 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:23:10" (3/3) ... [2022-11-03 02:23:10,649 INFO L112 eAbstractionObserver]: Analyzing ICFG race-3_2-container_of-global.i [2022-11-03 02:23:10,659 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-03 02:23:10,679 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-03 02:23:10,680 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 6 error locations. [2022-11-03 02:23:10,680 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-03 02:23:10,790 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-03 02:23:10,829 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-03 02:23:10,843 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 184 places, 186 transitions, 388 flow [2022-11-03 02:23:10,847 INFO L112 LiptonReduction]: Starting Lipton reduction on Petri net that has 184 places, 186 transitions, 388 flow [2022-11-03 02:23:10,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 186 transitions, 388 flow [2022-11-03 02:23:10,942 INFO L130 PetriNetUnfolder]: 10/231 cut-off events. [2022-11-03 02:23:10,942 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-03 02:23:10,946 INFO L83 FinitePrefix]: Finished finitePrefix Result has 240 conditions, 231 events. 10/231 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 335 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 137. Up to 4 conditions per place. [2022-11-03 02:23:10,949 INFO L118 LiptonReduction]: Number of co-enabled transitions 2160 [2022-11-03 02:24:18,829 INFO L133 LiptonReduction]: Checked pairs total: 4024 [2022-11-03 02:24:18,830 INFO L135 LiptonReduction]: Total number of compositions: 218 [2022-11-03 02:24:18,837 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 31 transitions, 78 flow [2022-11-03 02:24:18,867 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 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) [2022-11-03 02:24:18,885 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-03 02:24:18,892 INFO L357 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@28674fe0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-03 02:24:18,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2022-11-03 02:24:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 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) [2022-11-03 02:24:18,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2 [2022-11-03 02:24:18,907 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:18,907 INFO L195 NwaCegarLoop]: trace histogram [1] [2022-11-03 02:24:18,908 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:18,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:18,913 INFO L85 PathProgramCache]: Analyzing trace with hash 676, now seen corresponding path program 1 times [2022-11-03 02:24:18,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:18,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174143218] [2022-11-03 02:24:18,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:18,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:19,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:19,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:19,232 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:19,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174143218] [2022-11-03 02:24:19,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174143218] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:19,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:19,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2022-11-03 02:24:19,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899163835] [2022-11-03 02:24:19,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:19,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-03 02:24:19,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:19,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-03 02:24:19,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:24:19,274 INFO L87 Difference]: Start difference. First operand has 178 states, 168 states have (on average 2.3452380952380953) internal successors, (394), 177 states have internal predecessors, (394), 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 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-03 02:24:19,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:19,399 INFO L93 Difference]: Finished difference Result 176 states and 392 transitions. [2022-11-03 02:24:19,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-03 02:24:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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 1 [2022-11-03 02:24:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:19,417 INFO L225 Difference]: With dead ends: 176 [2022-11-03 02:24:19,417 INFO L226 Difference]: Without dead ends: 159 [2022-11-03 02:24:19,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-03 02:24:19,422 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:19,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:24:19,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-11-03 02:24:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2022-11-03 02:24:19,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 153 states have (on average 2.2941176470588234) internal successors, (351), 158 states have internal predecessors, (351), 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) [2022-11-03 02:24:19,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 351 transitions. [2022-11-03 02:24:19,495 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 351 transitions. Word has length 1 [2022-11-03 02:24:19,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:19,495 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 351 transitions. [2022-11-03 02:24:19,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) [2022-11-03 02:24:19,496 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 351 transitions. [2022-11-03 02:24:19,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:24:19,497 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:19,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:24:19,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-03 02:24:19,498 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:19,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:19,498 INFO L85 PathProgramCache]: Analyzing trace with hash 644930405, now seen corresponding path program 1 times [2022-11-03 02:24:19,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:19,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518695221] [2022-11-03 02:24:19,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:19,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:19,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:20,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:20,079 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:20,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518695221] [2022-11-03 02:24:20,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518695221] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:20,080 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:20,081 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:24:20,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713979820] [2022-11-03 02:24:20,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:20,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-03 02:24:20,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:20,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-03 02:24:20,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-03 02:24:20,092 INFO L87 Difference]: Start difference. First operand 159 states and 351 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-11-03 02:24:20,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:20,388 INFO L93 Difference]: Finished difference Result 232 states and 517 transitions. [2022-11-03 02:24:20,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-03 02:24:20,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2022-11-03 02:24:20,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:20,392 INFO L225 Difference]: With dead ends: 232 [2022-11-03 02:24:20,393 INFO L226 Difference]: Without dead ends: 232 [2022-11-03 02:24:20,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-03 02:24:20,394 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 11 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:20,395 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 2 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:24:20,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-11-03 02:24:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 202. [2022-11-03 02:24:20,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202 states, 197 states have (on average 2.3248730964467006) internal successors, (458), 201 states have internal predecessors, (458), 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) [2022-11-03 02:24:20,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 458 transitions. [2022-11-03 02:24:20,415 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 458 transitions. Word has length 5 [2022-11-03 02:24:20,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:20,416 INFO L495 AbstractCegarLoop]: Abstraction has 202 states and 458 transitions. [2022-11-03 02:24:20,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 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) [2022-11-03 02:24:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 458 transitions. [2022-11-03 02:24:20,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-03 02:24:20,417 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:20,417 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-03 02:24:20,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-03 02:24:20,418 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:20,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:20,419 INFO L85 PathProgramCache]: Analyzing trace with hash 644930456, now seen corresponding path program 1 times [2022-11-03 02:24:20,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:20,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192903568] [2022-11-03 02:24:20,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:20,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:20,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:20,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:20,753 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:20,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192903568] [2022-11-03 02:24:20,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192903568] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:20,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:20,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-03 02:24:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839662581] [2022-11-03 02:24:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:20,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:24:20,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:20,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:24:20,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:24:20,760 INFO L87 Difference]: Start difference. First operand 202 states and 458 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-11-03 02:24:20,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:20,918 INFO L93 Difference]: Finished difference Result 260 states and 572 transitions. [2022-11-03 02:24:20,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:24:20,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-11-03 02:24:20,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:20,922 INFO L225 Difference]: With dead ends: 260 [2022-11-03 02:24:20,922 INFO L226 Difference]: Without dead ends: 253 [2022-11-03 02:24:20,922 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:24:20,924 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 3 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:20,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:24:20,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-11-03 02:24:20,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 238. [2022-11-03 02:24:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 234 states have (on average 2.3162393162393164) internal successors, (542), 237 states have internal predecessors, (542), 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) [2022-11-03 02:24:20,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 542 transitions. [2022-11-03 02:24:20,963 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 542 transitions. Word has length 5 [2022-11-03 02:24:20,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:20,965 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 542 transitions. [2022-11-03 02:24:20,965 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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) [2022-11-03 02:24:20,966 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 542 transitions. [2022-11-03 02:24:20,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-03 02:24:20,969 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:20,969 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:20,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-03 02:24:20,969 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:20,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:20,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1831062936, now seen corresponding path program 1 times [2022-11-03 02:24:20,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:20,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931856623] [2022-11-03 02:24:20,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:20,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:21,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:21,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:21,142 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:21,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931856623] [2022-11-03 02:24:21,148 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931856623] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:21,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:21,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-03 02:24:21,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463645582] [2022-11-03 02:24:21,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:21,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-03 02:24:21,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:21,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-03 02:24:21,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-03 02:24:21,159 INFO L87 Difference]: Start difference. First operand 238 states and 542 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:24:21,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:21,248 INFO L93 Difference]: Finished difference Result 73 states and 144 transitions. [2022-11-03 02:24:21,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-03 02:24:21,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-03 02:24:21,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:21,250 INFO L225 Difference]: With dead ends: 73 [2022-11-03 02:24:21,250 INFO L226 Difference]: Without dead ends: 73 [2022-11-03 02:24:21,251 INFO L412 NwaCegarLoop]: 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 [2022-11-03 02:24:21,252 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:21,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-03 02:24:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-11-03 02:24:21,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-11-03 02:24:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 2.028169014084507) internal successors, (144), 72 states have internal predecessors, (144), 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) [2022-11-03 02:24:21,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 144 transitions. [2022-11-03 02:24:21,263 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 144 transitions. Word has length 10 [2022-11-03 02:24:21,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:21,264 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 144 transitions. [2022-11-03 02:24:21,264 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-03 02:24:21,264 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 144 transitions. [2022-11-03 02:24:21,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:21,266 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:21,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:21,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-03 02:24:21,269 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:21,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:21,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1999156610, now seen corresponding path program 1 times [2022-11-03 02:24:21,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:21,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865541001] [2022-11-03 02:24:21,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:21,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:21,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:23,996 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:23,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865541001] [2022-11-03 02:24:23,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865541001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:23,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:23,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:23,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275574019] [2022-11-03 02:24:23,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:23,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:23,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:23,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:23,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:23,999 INFO L87 Difference]: Start difference. First operand 73 states and 144 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:25,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:25,160 INFO L93 Difference]: Finished difference Result 118 states and 218 transitions. [2022-11-03 02:24:25,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-03 02:24:25,166 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:25,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:25,167 INFO L225 Difference]: With dead ends: 118 [2022-11-03 02:24:25,168 INFO L226 Difference]: Without dead ends: 105 [2022-11-03 02:24:25,169 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:24:25,173 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 42 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 395 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:25,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 0 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 395 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:25,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-03 02:24:25,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 78. [2022-11-03 02:24:25,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 76 states have (on average 2.0) internal successors, (152), 77 states have internal predecessors, (152), 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) [2022-11-03 02:24:25,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 152 transitions. [2022-11-03 02:24:25,186 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 152 transitions. Word has length 17 [2022-11-03 02:24:25,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:25,187 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 152 transitions. [2022-11-03 02:24:25,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:25,187 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 152 transitions. [2022-11-03 02:24:25,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:25,194 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:25,194 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:25,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-03 02:24:25,195 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:25,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:25,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1595317698, now seen corresponding path program 2 times [2022-11-03 02:24:25,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:25,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033160612] [2022-11-03 02:24:25,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:25,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:25,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:27,267 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:27,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033160612] [2022-11-03 02:24:27,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033160612] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:27,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:27,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:27,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056011539] [2022-11-03 02:24:27,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:27,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:27,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:27,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:27,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:27,269 INFO L87 Difference]: Start difference. First operand 78 states and 152 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:28,635 INFO L93 Difference]: Finished difference Result 118 states and 211 transitions. [2022-11-03 02:24:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:24:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:28,637 INFO L225 Difference]: With dead ends: 118 [2022-11-03 02:24:28,637 INFO L226 Difference]: Without dead ends: 109 [2022-11-03 02:24:28,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=298, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:24:28,638 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 59 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:28,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 0 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:28,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-11-03 02:24:28,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 87. [2022-11-03 02:24:28,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 85 states have (on average 1.9058823529411764) internal successors, (162), 86 states have internal predecessors, (162), 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) [2022-11-03 02:24:28,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 162 transitions. [2022-11-03 02:24:28,643 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 162 transitions. Word has length 17 [2022-11-03 02:24:28,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:28,643 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 162 transitions. [2022-11-03 02:24:28,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:28,644 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 162 transitions. [2022-11-03 02:24:28,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:28,644 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:28,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:28,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-03 02:24:28,657 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:28,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:28,658 INFO L85 PathProgramCache]: Analyzing trace with hash -725144894, now seen corresponding path program 3 times [2022-11-03 02:24:28,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:28,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248020025] [2022-11-03 02:24:28,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:28,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:30,538 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:30,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248020025] [2022-11-03 02:24:30,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248020025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:30,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:30,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:30,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114302776] [2022-11-03 02:24:30,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:30,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:30,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:30,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:30,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:30,540 INFO L87 Difference]: Start difference. First operand 87 states and 162 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:31,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:31,660 INFO L93 Difference]: Finished difference Result 111 states and 202 transitions. [2022-11-03 02:24:31,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:24:31,662 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:31,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:31,663 INFO L225 Difference]: With dead ends: 111 [2022-11-03 02:24:31,663 INFO L226 Difference]: Without dead ends: 100 [2022-11-03 02:24:31,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:24:31,664 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 48 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:31,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 0 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:31,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-11-03 02:24:31,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 76. [2022-11-03 02:24:31,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.9864864864864864) internal successors, (147), 75 states have internal predecessors, (147), 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) [2022-11-03 02:24:31,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 147 transitions. [2022-11-03 02:24:31,678 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 147 transitions. Word has length 17 [2022-11-03 02:24:31,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:31,679 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 147 transitions. [2022-11-03 02:24:31,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:31,679 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 147 transitions. [2022-11-03 02:24:31,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:31,680 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:31,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:31,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-03 02:24:31,680 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:31,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:31,681 INFO L85 PathProgramCache]: Analyzing trace with hash 977782960, now seen corresponding path program 4 times [2022-11-03 02:24:31,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:31,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918378273] [2022-11-03 02:24:31,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:31,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:33,310 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:33,310 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:33,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918378273] [2022-11-03 02:24:33,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918378273] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:33,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:33,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:33,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776198522] [2022-11-03 02:24:33,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:33,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:33,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:33,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:33,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:33,312 INFO L87 Difference]: Start difference. First operand 76 states and 147 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:34,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:34,428 INFO L93 Difference]: Finished difference Result 111 states and 206 transitions. [2022-11-03 02:24:34,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-03 02:24:34,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:34,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:34,430 INFO L225 Difference]: With dead ends: 111 [2022-11-03 02:24:34,430 INFO L226 Difference]: Without dead ends: 91 [2022-11-03 02:24:34,430 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2022-11-03 02:24:34,431 INFO L413 NwaCegarLoop]: 0 mSDtfsCounter, 41 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:34,431 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 0 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:34,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-03 02:24:34,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 73. [2022-11-03 02:24:34,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 71 states have (on average 1.9859154929577465) internal successors, (141), 72 states have internal predecessors, (141), 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) [2022-11-03 02:24:34,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 141 transitions. [2022-11-03 02:24:34,435 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 141 transitions. Word has length 17 [2022-11-03 02:24:34,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:34,435 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 141 transitions. [2022-11-03 02:24:34,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 141 transitions. [2022-11-03 02:24:34,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:34,436 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:34,436 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:34,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-03 02:24:34,444 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:34,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:34,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1239755858, now seen corresponding path program 5 times [2022-11-03 02:24:34,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:34,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973294139] [2022-11-03 02:24:34,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:34,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:35,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:35,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973294139] [2022-11-03 02:24:35,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973294139] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:35,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:35,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:35,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013363241] [2022-11-03 02:24:35,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:35,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:35,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:35,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:35,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:35,962 INFO L87 Difference]: Start difference. First operand 73 states and 141 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:37,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:37,148 INFO L93 Difference]: Finished difference Result 148 states and 257 transitions. [2022-11-03 02:24:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-03 02:24:37,149 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:37,150 INFO L225 Difference]: With dead ends: 148 [2022-11-03 02:24:37,150 INFO L226 Difference]: Without dead ends: 148 [2022-11-03 02:24:37,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=78, Invalid=264, Unknown=0, NotChecked=0, Total=342 [2022-11-03 02:24:37,151 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 59 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:37,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 3 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:37,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-11-03 02:24:37,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 90. [2022-11-03 02:24:37,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.9318181818181819) internal successors, (170), 89 states have internal predecessors, (170), 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) [2022-11-03 02:24:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 170 transitions. [2022-11-03 02:24:37,162 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 170 transitions. Word has length 17 [2022-11-03 02:24:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:37,163 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 170 transitions. [2022-11-03 02:24:37,163 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:37,163 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 170 transitions. [2022-11-03 02:24:37,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:37,164 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:37,164 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:37,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-03 02:24:37,165 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:37,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:37,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1239755884, now seen corresponding path program 1 times [2022-11-03 02:24:37,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:37,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839369252] [2022-11-03 02:24:37,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:37,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:38,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:38,016 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:38,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839369252] [2022-11-03 02:24:38,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839369252] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:38,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:38,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-03 02:24:38,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778488719] [2022-11-03 02:24:38,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:38,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-03 02:24:38,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:38,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-03 02:24:38,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-03 02:24:38,018 INFO L87 Difference]: Start difference. First operand 90 states and 170 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2022-11-03 02:24:38,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:38,488 INFO L93 Difference]: Finished difference Result 120 states and 213 transitions. [2022-11-03 02:24:38,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-03 02:24:38,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:38,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:38,490 INFO L225 Difference]: With dead ends: 120 [2022-11-03 02:24:38,490 INFO L226 Difference]: Without dead ends: 107 [2022-11-03 02:24:38,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-03 02:24:38,491 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 40 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:38,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-03 02:24:38,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-03 02:24:38,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 99. [2022-11-03 02:24:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.8969072164948453) internal successors, (184), 98 states have internal predecessors, (184), 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) [2022-11-03 02:24:38,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 184 transitions. [2022-11-03 02:24:38,496 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 184 transitions. Word has length 17 [2022-11-03 02:24:38,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:38,496 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 184 transitions. [2022-11-03 02:24:38,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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) [2022-11-03 02:24:38,496 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 184 transitions. [2022-11-03 02:24:38,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:38,498 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:38,498 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:38,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-03 02:24:38,498 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:38,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:38,499 INFO L85 PathProgramCache]: Analyzing trace with hash -539262870, now seen corresponding path program 6 times [2022-11-03 02:24:38,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:38,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545606109] [2022-11-03 02:24:38,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:38,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:39,872 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:39,872 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:39,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545606109] [2022-11-03 02:24:39,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545606109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:39,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:39,873 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:39,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343931142] [2022-11-03 02:24:39,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:39,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:39,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:39,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:39,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:39,874 INFO L87 Difference]: Start difference. First operand 99 states and 184 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:41,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:41,072 INFO L93 Difference]: Finished difference Result 210 states and 345 transitions. [2022-11-03 02:24:41,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-03 02:24:41,073 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:41,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:41,074 INFO L225 Difference]: With dead ends: 210 [2022-11-03 02:24:41,074 INFO L226 Difference]: Without dead ends: 201 [2022-11-03 02:24:41,075 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-11-03 02:24:41,076 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 74 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:41,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 4 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-03 02:24:41,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-11-03 02:24:41,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 101. [2022-11-03 02:24:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 99 states have (on average 1.8888888888888888) internal successors, (187), 100 states have internal predecessors, (187), 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) [2022-11-03 02:24:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 187 transitions. [2022-11-03 02:24:41,082 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 187 transitions. Word has length 17 [2022-11-03 02:24:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:41,083 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 187 transitions. [2022-11-03 02:24:41,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 187 transitions. [2022-11-03 02:24:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:41,084 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:41,084 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:41,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-03 02:24:41,085 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:41,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:41,086 INFO L85 PathProgramCache]: Analyzing trace with hash 330909934, now seen corresponding path program 7 times [2022-11-03 02:24:41,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:41,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011979393] [2022-11-03 02:24:41,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:41,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:42,430 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:42,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011979393] [2022-11-03 02:24:42,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011979393] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:42,430 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:42,430 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:42,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665344487] [2022-11-03 02:24:42,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:42,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:42,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:42,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:42,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:42,432 INFO L87 Difference]: Start difference. First operand 101 states and 187 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:43,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:43,734 INFO L93 Difference]: Finished difference Result 206 states and 339 transitions. [2022-11-03 02:24:43,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:24:43,735 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:43,737 INFO L225 Difference]: With dead ends: 206 [2022-11-03 02:24:43,737 INFO L226 Difference]: Without dead ends: 195 [2022-11-03 02:24:43,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:24:43,738 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 62 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 385 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:43,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 4 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 385 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:43,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-11-03 02:24:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 97. [2022-11-03 02:24:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 95 states have (on average 1.8842105263157896) internal successors, (179), 96 states have internal predecessors, (179), 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) [2022-11-03 02:24:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 179 transitions. [2022-11-03 02:24:43,745 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 179 transitions. Word has length 17 [2022-11-03 02:24:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:43,746 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 179 transitions. [2022-11-03 02:24:43,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 179 transitions. [2022-11-03 02:24:43,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:43,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:43,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:43,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-03 02:24:43,748 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:43,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:43,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1619850470, now seen corresponding path program 8 times [2022-11-03 02:24:43,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:43,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706424561] [2022-11-03 02:24:43,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:43,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:43,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-03 02:24:44,999 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-03 02:24:44,999 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-03 02:24:44,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706424561] [2022-11-03 02:24:45,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706424561] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-03 02:24:45,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-03 02:24:45,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-03 02:24:45,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182365000] [2022-11-03 02:24:45,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-03 02:24:45,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-03 02:24:45,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-03 02:24:45,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-03 02:24:45,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-11-03 02:24:45,001 INFO L87 Difference]: Start difference. First operand 97 states and 179 transitions. Second operand has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-03 02:24:46,258 INFO L93 Difference]: Finished difference Result 178 states and 297 transitions. [2022-11-03 02:24:46,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-03 02:24:46,259 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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 17 [2022-11-03 02:24:46,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-03 02:24:46,260 INFO L225 Difference]: With dead ends: 178 [2022-11-03 02:24:46,260 INFO L226 Difference]: Without dead ends: 165 [2022-11-03 02:24:46,261 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2022-11-03 02:24:46,261 INFO L413 NwaCegarLoop]: 1 mSDtfsCounter, 60 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 3 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-03 02:24:46,261 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 3 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-03 02:24:46,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-11-03 02:24:46,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-11-03 02:24:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.875) internal successors, (180), 97 states have internal predecessors, (180), 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) [2022-11-03 02:24:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 180 transitions. [2022-11-03 02:24:46,266 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 180 transitions. Word has length 17 [2022-11-03 02:24:46,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-03 02:24:46,266 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 180 transitions. [2022-11-03 02:24:46,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 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) [2022-11-03 02:24:46,266 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 180 transitions. [2022-11-03 02:24:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-03 02:24:46,267 INFO L187 NwaCegarLoop]: Found error trace [2022-11-03 02:24:46,267 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-03 02:24:46,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-03 02:24:46,268 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2022-11-03 02:24:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-03 02:24:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash -377429270, now seen corresponding path program 9 times [2022-11-03 02:24:46,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-03 02:24:46,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768755433] [2022-11-03 02:24:46,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-03 02:24:46,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-03 02:24:46,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:24:46,315 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-03 02:24:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-03 02:24:46,421 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-03 02:24:46,421 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-03 02:24:46,423 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2022-11-03 02:24:46,425 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2022-11-03 02:24:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2022-11-03 02:24:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2022-11-03 02:24:46,426 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2022-11-03 02:24:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2022-11-03 02:24:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2022-11-03 02:24:46,427 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2022-11-03 02:24:46,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-03 02:24:46,430 INFO L444 BasicCegarLoop]: Path program histogram: [9, 1, 1, 1, 1, 1] [2022-11-03 02:24:46,436 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-03 02:24:46,437 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-03 02:24:46,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 02:24:46 BasicIcfg [2022-11-03 02:24:46,509 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-03 02:24:46,509 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-03 02:24:46,510 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-03 02:24:46,510 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-03 02:24:46,510 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 02:23:10" (3/4) ... [2022-11-03 02:24:46,512 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-03 02:24:46,566 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/witness.graphml [2022-11-03 02:24:46,566 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-03 02:24:46,566 INFO L158 Benchmark]: Toolchain (without parser) took 98161.62ms. Allocated memory was 100.7MB in the beginning and 339.7MB in the end (delta: 239.1MB). Free memory was 64.7MB in the beginning and 253.6MB in the end (delta: -188.9MB). Peak memory consumption was 49.6MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,567 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 100.7MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-03 02:24:46,567 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1233.52ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 64.5MB in the beginning and 95.9MB in the end (delta: -31.4MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,568 INFO L158 Benchmark]: Boogie Procedure Inliner took 97.66ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 92.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,568 INFO L158 Benchmark]: Boogie Preprocessor took 41.13ms. Allocated memory is still 134.2MB. Free memory was 92.4MB in the beginning and 89.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,568 INFO L158 Benchmark]: RCFGBuilder took 853.68ms. Allocated memory is still 134.2MB. Free memory was 89.6MB in the beginning and 65.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,569 INFO L158 Benchmark]: TraceAbstraction took 95869.25ms. Allocated memory was 134.2MB in the beginning and 339.7MB in the end (delta: 205.5MB). Free memory was 65.1MB in the beginning and 260.9MB in the end (delta: -195.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,569 INFO L158 Benchmark]: Witness Printer took 56.50ms. Allocated memory is still 339.7MB. Free memory was 260.9MB in the beginning and 253.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-03 02:24:46,571 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.30ms. Allocated memory is still 100.7MB. Free memory is still 53.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1233.52ms. Allocated memory was 100.7MB in the beginning and 134.2MB in the end (delta: 33.6MB). Free memory was 64.5MB in the beginning and 95.9MB in the end (delta: -31.4MB). Peak memory consumption was 29.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 97.66ms. Allocated memory is still 134.2MB. Free memory was 95.9MB in the beginning and 92.4MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.13ms. Allocated memory is still 134.2MB. Free memory was 92.4MB in the beginning and 89.6MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 853.68ms. Allocated memory is still 134.2MB. Free memory was 89.6MB in the beginning and 65.8MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 95869.25ms. Allocated memory was 134.2MB in the beginning and 339.7MB in the end (delta: 205.5MB). Free memory was 65.1MB in the beginning and 260.9MB in the end (delta: -195.8MB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Witness Printer took 56.50ms. Allocated memory is still 339.7MB. Free memory was 260.9MB in the beginning and 253.6MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 68.0s, 184 PlacesBefore, 35 PlacesAfterwards, 186 TransitionsBefore, 31 TransitionsAfterwards, 2160 CoEnabledTransitionPairs, 9 FixpointIterations, 116 TrivialSequentialCompositions, 63 ConcurrentSequentialCompositions, 11 TrivialYvCompositions, 22 ConcurrentYvCompositions, 6 ChoiceCompositions, 218 TotalNumberOfCompositions, 4024 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2014, positive: 1836, positive conditional: 0, positive unconditional: 1836, negative: 178, negative conditional: 0, negative unconditional: 178, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1484, positive: 1433, positive conditional: 0, positive unconditional: 1433, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1484, positive: 1430, positive conditional: 0, positive unconditional: 1430, negative: 54, negative conditional: 0, negative unconditional: 54, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 54, positive: 3, positive conditional: 0, positive unconditional: 3, negative: 32, negative conditional: 0, negative unconditional: 32, unknown: 19, unknown conditional: 0, unknown unconditional: 19] , SemanticIndependenceRelation.Query Time [ms]: [ total: 47810, positive: 60, positive conditional: 0, positive unconditional: 60, negative: 469, negative conditional: 0, negative unconditional: 469, unknown: 47281, unknown conditional: 0, unknown unconditional: 47281] ], Cache Queries: [ total: 2014, positive: 403, positive conditional: 0, positive unconditional: 403, negative: 127, negative conditional: 0, negative unconditional: 127, unknown: 1484, unknown conditional: 0, unknown unconditional: 1484] , Statistics on independence cache: Total cache size (in pairs): 50, Positive cache size: 28, Positive conditional cache size: 0, Positive unconditional cache size: 28, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - 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: 1675]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1676] 0 pthread_t t1,t2; [L1688] 0 struct device *my_dev; [L1733] CALL, EXPR 0 my_drv_init() [L1727] 0 return 0; [L1733] RET, EXPR 0 my_drv_init() [L1733] 0 int ret = my_drv_init(); [L1734] COND TRUE 0 ret==0 [L1735] 0 int probe_ret; [L1736] 0 struct my_data data; [L1737] CALL, EXPR 0 my_drv_probe(&data) [L1705] 0 data->shared.a = 0 [L1706] 0 data->shared.b = 0 [L1707] EXPR 0 data->shared.a [L1707] CALL 0 ldv_assert(data->shared.a==0) [L1675] COND FALSE 0 !(!expression) [L1707] RET 0 ldv_assert(data->shared.a==0) [L1708] EXPR 0 data->shared.b [L1708] CALL 0 ldv_assert(data->shared.b==0) [L1675] COND FALSE 0 !(!expression) [L1708] RET 0 ldv_assert(data->shared.b==0) [L1709] 0 int res = __VERIFIER_nondet_int(); [L1710] COND FALSE 0 !(\read(res)) [L1712] 0 my_dev = &data->dev [L1713] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, ((void *)0)) VAL [arg={0:0}, data={6:0}, data={6:0}, my_dev={6:24}, pthread_create(&t1, ((void *)0), my_callback, ((void *)0))=7, res=0, t1={3:0}, t2={4:0}] [L1690] 1 struct my_data *data; [L1691] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 1 data->shared.a = 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1696] EXPR 1 data->shared.b [L1696] 1 int lb = data->shared.b; [L1714] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, ((void *)0)) VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, pthread_create(&t2, ((void *)0), my_callback, ((void *)0))=8, res=0, t1={3:0}, t2={4:0}] [L1715] 0 return 0; [L1737] RET, EXPR 0 my_drv_probe(&data) [L1690] 2 struct my_data *data; [L1691] 2 const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); [L1691] 2 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (my_dev); (struct my_data *)( (char *)__mptr - ((unsigned long) &((struct my_data *)0)->dev) );}) [L1693] 2 data->shared.a = 1 VAL [__mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] [L1737] 0 probe_ret = my_drv_probe(&data) [L1738] COND TRUE 0 probe_ret==0 [L1739] CALL 0 my_drv_disconnect(&data) [L1721] 0 void *status; [L1722] 0 \read(t1) VAL [\read(t1)=7, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1696] EXPR 2 data->shared.b [L1696] 2 int lb = data->shared.b; [L1699] 1 data->shared.b = lb + 1 [L1701] 1 return 0; [L1699] 2 data->shared.b = lb + 1 [L1701] 2 return 0; [L1722] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\read(t1)=7, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, pthread_join(t1, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] 0 \read(t2) VAL [\read(t2)=8, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, status={5:0}, t1={3:0}, t2={4:0}] [L1723] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\read(t2)=8, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, data={6:0}, data={6:0}, lb=0, my_dev={6:24}, pthread_join(t2, &status)={0:0}, status={5:0}, t1={3:0}, t2={4:0}] [L1739] RET 0 my_drv_disconnect(&data) [L1740] EXPR 0 data.shared.a [L1740] CALL 0 ldv_assert(data.shared.a==1) [L1675] COND FALSE 0 !(!expression) [L1740] RET 0 ldv_assert(data.shared.a==1) [L1741] EXPR 0 data.shared.b [L1741] CALL 0 ldv_assert(data.shared.b==2) [L1675] COND TRUE 0 !expression [L1675] 0 reach_error() VAL [\old(expression)=0, \result={0:0}, __mptr={6:24}, arg={0:0}, arg={0:0}, data={6:0}, expression=0, lb=0, my_dev={6:24}, t1={3:0}, t2={4:0}] - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1675]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 4 procedures, 190 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 95.6s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 11.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 68.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 505 SdHoareTripleChecker+Valid, 5.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 505 mSDsluCounter, 24 SdHoareTripleChecker+Invalid, 4.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 703 mSDsCounter, 311 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3277 IncrementalHoareTripleChecker+Invalid, 3588 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 311 mSolverCounterUnsat, 12 mSDtfsCounter, 3277 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 168 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=238occurred in iteration=3, InterpolantAutomatonStates: 119, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 13 MinimizatonAttempts, 467 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 15.0s InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 161 ConstructedInterpolants, 0 QuantifiedInterpolants, 3700 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-03 02:24:46,676 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6e55e426-37f6-482c-8eb1-0d2cb7c270e1/bin/utaipan-7li7fVZpFI/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