./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4e7fbc69 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_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW --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 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 --- 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-4e7fbc6 [2022-11-23 14:25:41,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 14:25:41,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 14:25:41,184 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 14:25:41,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 14:25:41,186 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 14:25:41,188 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 14:25:41,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 14:25:41,200 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 14:25:41,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 14:25:41,209 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 14:25:41,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 14:25:41,213 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 14:25:41,216 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 14:25:41,219 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 14:25:41,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 14:25:41,222 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 14:25:41,223 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 14:25:41,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 14:25:41,227 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 14:25:41,228 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 14:25:41,233 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 14:25:41,236 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 14:25:41,237 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 14:25:41,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 14:25:41,253 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 14:25:41,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 14:25:41,255 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 14:25:41,255 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 14:25:41,256 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 14:25:41,257 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 14:25:41,258 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 14:25:41,259 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 14:25:41,260 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 14:25:41,261 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 14:25:41,261 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 14:25:41,266 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 14:25:41,268 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 14:25:41,268 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 14:25:41,270 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 14:25:41,271 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 14:25:41,272 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 14:25:41,324 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 14:25:41,324 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 14:25:41,325 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 14:25:41,325 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 14:25:41,337 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 14:25:41,338 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 14:25:41,338 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 14:25:41,338 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 14:25:41,338 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 14:25:41,339 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 14:25:41,340 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 14:25:41,340 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 14:25:41,341 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 14:25:41,341 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 14:25:41,341 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 14:25:41,341 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 14:25:41,342 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 14:25:41,342 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 14:25:41,343 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 14:25:41,343 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 14:25:41,343 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 14:25:41,343 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 14:25:41,344 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 14:25:41,344 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 14:25:41,344 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 14:25:41,344 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 14:25:41,345 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 14:25:41,345 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 14:25:41,346 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 14:25:41,346 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 14:25:41,347 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 14:25:41,347 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 14:25:41,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:25:41,347 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 14:25:41,348 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 14:25:41,348 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 14:25:41,348 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 14:25:41,348 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 14:25:41,349 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 14:25:41,349 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 14:25:41,349 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 14:25:41,349 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_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/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_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW 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 -> 23eea01b75afdbb0ef381e4ddf0b030c295f59ec7a283af707e459bd9dd9c0c0 [2022-11-23 14:25:41,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 14:25:41,767 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 14:25:41,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 14:25:41,772 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 14:25:41,772 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 14:25:41,774 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-23 14:25:45,089 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 14:25:45,387 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 14:25:45,388 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i [2022-11-23 14:25:45,403 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/data/e9a784cca/1899af20bfc041cf9a679847df9d8545/FLAGa36b1e31e [2022-11-23 14:25:45,424 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/data/e9a784cca/1899af20bfc041cf9a679847df9d8545 [2022-11-23 14:25:45,427 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 14:25:45,429 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 14:25:45,433 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 14:25:45,434 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 14:25:45,438 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 14:25:45,439 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:45" (1/1) ... [2022-11-23 14:25:45,440 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e658dac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:45, skipping insertion in model container [2022-11-23 14:25:45,441 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 02:25:45" (1/1) ... [2022-11-23 14:25:45,450 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 14:25:45,524 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 14:25:45,761 WARN L237 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_0db3c2ae-8afb-44e5-80cf-848a02484c47/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-23 14:25:46,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:25:46,098 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 14:25:46,120 WARN L237 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_0db3c2ae-8afb-44e5-80cf-848a02484c47/sv-benchmarks/c/pthread-wmm/safe000_power.opt.i[951,964] [2022-11-23 14:25:46,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 14:25:46,266 INFO L208 MainTranslator]: Completed translation [2022-11-23 14:25:46,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46 WrapperNode [2022-11-23 14:25:46,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 14:25:46,269 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 14:25:46,269 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 14:25:46,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 14:25:46,279 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,320 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,376 INFO L138 Inliner]: procedures = 176, calls = 73, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 180 [2022-11-23 14:25:46,377 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 14:25:46,378 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 14:25:46,378 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 14:25:46,378 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 14:25:46,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,397 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,415 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,425 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,445 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,447 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 14:25:46,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 14:25:46,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 14:25:46,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 14:25:46,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (1/1) ... [2022-11-23 14:25:46,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 14:25:46,502 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 14:25:46,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 14:25:46,538 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 14:25:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-23 14:25:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 14:25:46,580 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 14:25:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 14:25:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 14:25:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 14:25:46,581 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 14:25:46,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 14:25:46,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 14:25:46,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 14:25:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 14:25:46,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 14:25:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 14:25:46,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 14:25:46,584 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 14:25:46,584 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 14:25:46,586 WARN L209 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-23 14:25:46,816 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 14:25:46,820 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 14:25:47,444 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 14:25:47,887 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 14:25:47,887 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 14:25:47,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:47 BoogieIcfgContainer [2022-11-23 14:25:47,891 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 14:25:47,895 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 14:25:47,895 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 14:25:47,899 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 14:25:47,899 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 02:25:45" (1/3) ... [2022-11-23 14:25:47,900 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498cfc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:47, skipping insertion in model container [2022-11-23 14:25:47,901 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 02:25:46" (2/3) ... [2022-11-23 14:25:47,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498cfc28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 02:25:47, skipping insertion in model container [2022-11-23 14:25:47,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:47" (3/3) ... [2022-11-23 14:25:47,907 INFO L112 eAbstractionObserver]: Analyzing ICFG safe000_power.opt.i [2022-11-23 14:25:47,962 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 14:25:47,975 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 14:25:47,975 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 14:25:47,975 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 14:25:48,116 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 14:25:48,177 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 14:25:48,210 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-23 14:25:48,214 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 134 transitions, 283 flow [2022-11-23 14:25:48,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 134 transitions, 283 flow [2022-11-23 14:25:48,333 INFO L130 PetriNetUnfolder]: 2/131 cut-off events. [2022-11-23 14:25:48,337 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 14:25:48,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 131 events. 2/131 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 56 event pairs, 0 based on Foata normal form. 0/127 useless extension candidates. Maximal degree in co-relation 73. Up to 2 conditions per place. [2022-11-23 14:25:48,349 INFO L119 LiptonReduction]: Number of co-enabled transitions 2096 [2022-11-23 14:26:01,136 INFO L134 LiptonReduction]: Checked pairs total: 6201 [2022-11-23 14:26:01,136 INFO L136 LiptonReduction]: Total number of compositions: 119 [2022-11-23 14:26:01,146 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 37 places, 28 transitions, 71 flow [2022-11-23 14:26:01,251 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 899 states, 896 states have (on average 3.3504464285714284) internal successors, (3002), 898 states have internal predecessors, (3002), 0 states have call successors, (0), 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-23 14:26:01,287 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 14:26:01,296 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;@6742d732, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 14:26:01,296 INFO L358 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2022-11-23 14:26:01,302 INFO L276 IsEmpty]: Start isEmpty. Operand has 899 states, 896 states have (on average 3.3504464285714284) internal successors, (3002), 898 states have internal predecessors, (3002), 0 states have call successors, (0), 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-23 14:26:01,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-11-23 14:26:01,309 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:01,309 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-11-23 14:26:01,310 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:01,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:01,316 INFO L85 PathProgramCache]: Analyzing trace with hash 26076606, now seen corresponding path program 1 times [2022-11-23 14:26:01,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:01,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285861067] [2022-11-23 14:26:01,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:01,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:01,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:01,992 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-23 14:26:01,992 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:01,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285861067] [2022-11-23 14:26:01,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285861067] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:01,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:01,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 14:26:01,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562417345] [2022-11-23 14:26:01,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:02,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 14:26:02,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:02,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 14:26:02,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 14:26:02,032 INFO L87 Difference]: Start difference. First operand has 899 states, 896 states have (on average 3.3504464285714284) internal successors, (3002), 898 states have internal predecessors, (3002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-23 14:26:02,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:02,229 INFO L93 Difference]: Finished difference Result 737 states and 2305 transitions. [2022-11-23 14:26:02,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 14:26:02,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-11-23 14:26:02,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:02,253 INFO L225 Difference]: With dead ends: 737 [2022-11-23 14:26:02,254 INFO L226 Difference]: Without dead ends: 687 [2022-11-23 14:26:02,255 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-23 14:26:02,259 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 13 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:02,260 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:02,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-11-23 14:26:02,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 687. [2022-11-23 14:26:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 686 states have (on average 3.1341107871720117) internal successors, (2150), 686 states have internal predecessors, (2150), 0 states have call successors, (0), 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-23 14:26:02,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 2150 transitions. [2022-11-23 14:26:02,367 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 2150 transitions. Word has length 4 [2022-11-23 14:26:02,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:02,368 INFO L495 AbstractCegarLoop]: Abstraction has 687 states and 2150 transitions. [2022-11-23 14:26:02,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 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-23 14:26:02,368 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 2150 transitions. [2022-11-23 14:26:02,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-23 14:26:02,370 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:02,370 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:02,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 14:26:02,371 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:02,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:02,372 INFO L85 PathProgramCache]: Analyzing trace with hash 244700616, now seen corresponding path program 1 times [2022-11-23 14:26:02,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:02,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419974083] [2022-11-23 14:26:02,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:02,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:02,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:02,738 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-23 14:26:02,738 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419974083] [2022-11-23 14:26:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419974083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:02,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:26:02,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81214052] [2022-11-23 14:26:02,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:02,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:02,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:02,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:02,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:02,743 INFO L87 Difference]: Start difference. First operand 687 states and 2150 transitions. Second operand has 4 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-23 14:26:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:02,972 INFO L93 Difference]: Finished difference Result 762 states and 2295 transitions. [2022-11-23 14:26:02,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:02,976 INFO L78 Accepts]: Start accepts. Automaton has has 4 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-23 14:26:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:02,985 INFO L225 Difference]: With dead ends: 762 [2022-11-23 14:26:02,986 INFO L226 Difference]: Without dead ends: 637 [2022-11-23 14:26:02,986 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-23 14:26:02,988 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 29 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:02,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 10 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:02,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 637 states. [2022-11-23 14:26:03,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 637 to 637. [2022-11-23 14:26:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 637 states, 636 states have (on average 3.09748427672956) internal successors, (1970), 636 states have internal predecessors, (1970), 0 states have call successors, (0), 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-23 14:26:03,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 637 states to 637 states and 1970 transitions. [2022-11-23 14:26:03,046 INFO L78 Accepts]: Start accepts. Automaton has 637 states and 1970 transitions. Word has length 10 [2022-11-23 14:26:03,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:03,048 INFO L495 AbstractCegarLoop]: Abstraction has 637 states and 1970 transitions. [2022-11-23 14:26:03,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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-23 14:26:03,048 INFO L276 IsEmpty]: Start isEmpty. Operand 637 states and 1970 transitions. [2022-11-23 14:26:03,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-23 14:26:03,055 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:03,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:03,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 14:26:03,058 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:03,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:03,059 INFO L85 PathProgramCache]: Analyzing trace with hash 257264733, now seen corresponding path program 1 times [2022-11-23 14:26:03,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:03,067 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720558646] [2022-11-23 14:26:03,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:03,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:03,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:03,398 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-23 14:26:03,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:03,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720558646] [2022-11-23 14:26:03,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720558646] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:03,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:03,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:03,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072767831] [2022-11-23 14:26:03,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:03,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:03,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:03,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:03,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:03,401 INFO L87 Difference]: Start difference. First operand 637 states and 1970 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-23 14:26:03,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:03,589 INFO L93 Difference]: Finished difference Result 697 states and 2083 transitions. [2022-11-23 14:26:03,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:03,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-11-23 14:26:03,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:03,595 INFO L225 Difference]: With dead ends: 697 [2022-11-23 14:26:03,595 INFO L226 Difference]: Without dead ends: 597 [2022-11-23 14:26:03,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:26:03,597 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 34 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:03,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 14 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:03,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2022-11-23 14:26:03,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 597. [2022-11-23 14:26:03,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 3.0671140939597317) internal successors, (1828), 596 states have internal predecessors, (1828), 0 states have call successors, (0), 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-23 14:26:03,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 1828 transitions. [2022-11-23 14:26:03,624 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 1828 transitions. Word has length 11 [2022-11-23 14:26:03,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:03,624 INFO L495 AbstractCegarLoop]: Abstraction has 597 states and 1828 transitions. [2022-11-23 14:26:03,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 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-23 14:26:03,624 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 1828 transitions. [2022-11-23 14:26:03,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 14:26:03,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:03,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:03,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 14:26:03,627 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:03,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:03,628 INFO L85 PathProgramCache]: Analyzing trace with hash -614760989, now seen corresponding path program 1 times [2022-11-23 14:26:03,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:03,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [576422577] [2022-11-23 14:26:03,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:03,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:04,032 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-23 14:26:04,033 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:04,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [576422577] [2022-11-23 14:26:04,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [576422577] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:04,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:04,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 14:26:04,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679680985] [2022-11-23 14:26:04,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:04,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:04,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:04,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:04,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:04,042 INFO L87 Difference]: Start difference. First operand 597 states and 1828 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-23 14:26:04,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:04,236 INFO L93 Difference]: Finished difference Result 645 states and 1916 transitions. [2022-11-23 14:26:04,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:04,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-11-23 14:26:04,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:04,242 INFO L225 Difference]: With dead ends: 645 [2022-11-23 14:26:04,242 INFO L226 Difference]: Without dead ends: 565 [2022-11-23 14:26:04,242 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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-23 14:26:04,245 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 22 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:04,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 10 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:04,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 565 states. [2022-11-23 14:26:04,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 565 to 565. [2022-11-23 14:26:04,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 564 states have (on average 3.0425531914893615) internal successors, (1716), 564 states have internal predecessors, (1716), 0 states have call successors, (0), 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-23 14:26:04,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 1716 transitions. [2022-11-23 14:26:04,329 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 1716 transitions. Word has length 12 [2022-11-23 14:26:04,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:04,329 INFO L495 AbstractCegarLoop]: Abstraction has 565 states and 1716 transitions. [2022-11-23 14:26:04,330 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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-23 14:26:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 1716 transitions. [2022-11-23 14:26:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-23 14:26:04,333 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:04,333 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:04,333 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 14:26:04,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:04,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:04,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1877753634, now seen corresponding path program 1 times [2022-11-23 14:26:04,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:04,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627403346] [2022-11-23 14:26:04,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:04,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:04,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:04,761 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-23 14:26:04,761 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:04,761 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627403346] [2022-11-23 14:26:04,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627403346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:04,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:04,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:04,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169939561] [2022-11-23 14:26:04,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:04,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:04,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:04,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:04,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:04,773 INFO L87 Difference]: Start difference. First operand 565 states and 1716 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-23 14:26:05,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:05,031 INFO L93 Difference]: Finished difference Result 897 states and 2693 transitions. [2022-11-23 14:26:05,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:26:05,031 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-11-23 14:26:05,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:05,035 INFO L225 Difference]: With dead ends: 897 [2022-11-23 14:26:05,036 INFO L226 Difference]: Without dead ends: 485 [2022-11-23 14:26:05,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:26:05,037 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:05,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 8 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:05,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2022-11-23 14:26:05,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 485. [2022-11-23 14:26:05,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 485 states, 484 states have (on average 2.987603305785124) internal successors, (1446), 484 states have internal predecessors, (1446), 0 states have call successors, (0), 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-23 14:26:05,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1446 transitions. [2022-11-23 14:26:05,060 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1446 transitions. Word has length 13 [2022-11-23 14:26:05,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:05,061 INFO L495 AbstractCegarLoop]: Abstraction has 485 states and 1446 transitions. [2022-11-23 14:26:05,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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-23 14:26:05,061 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1446 transitions. [2022-11-23 14:26:05,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:26:05,063 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:05,063 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:05,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 14:26:05,064 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:05,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:05,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1085183472, now seen corresponding path program 1 times [2022-11-23 14:26:05,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:05,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059100374] [2022-11-23 14:26:05,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:05,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:05,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:05,443 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-23 14:26:05,443 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:05,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059100374] [2022-11-23 14:26:05,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059100374] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:05,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:05,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:05,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24485192] [2022-11-23 14:26:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:05,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:05,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:05,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:05,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:05,446 INFO L87 Difference]: Start difference. First operand 485 states and 1446 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-23 14:26:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:05,633 INFO L93 Difference]: Finished difference Result 701 states and 2076 transitions. [2022-11-23 14:26:05,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:05,634 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-23 14:26:05,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:05,637 INFO L225 Difference]: With dead ends: 701 [2022-11-23 14:26:05,637 INFO L226 Difference]: Without dead ends: 365 [2022-11-23 14:26:05,637 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:05,638 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:05,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 7 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2022-11-23 14:26:05,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 365. [2022-11-23 14:26:05,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 365 states, 364 states have (on average 2.912087912087912) internal successors, (1060), 364 states have internal predecessors, (1060), 0 states have call successors, (0), 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-23 14:26:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 1060 transitions. [2022-11-23 14:26:05,655 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 1060 transitions. Word has length 14 [2022-11-23 14:26:05,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:05,656 INFO L495 AbstractCegarLoop]: Abstraction has 365 states and 1060 transitions. [2022-11-23 14:26:05,656 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 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-23 14:26:05,656 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 1060 transitions. [2022-11-23 14:26:05,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 14:26:05,657 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:05,657 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:05,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 14:26:05,658 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:05,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:05,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1107347015, now seen corresponding path program 1 times [2022-11-23 14:26:05,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:05,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224931148] [2022-11-23 14:26:05,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:05,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:05,963 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-23 14:26:05,963 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:05,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224931148] [2022-11-23 14:26:05,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224931148] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:05,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:05,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:05,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593499167] [2022-11-23 14:26:05,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:05,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:05,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:05,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:05,966 INFO L87 Difference]: Start difference. First operand 365 states and 1060 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-23 14:26:06,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:06,227 INFO L93 Difference]: Finished difference Result 497 states and 1427 transitions. [2022-11-23 14:26:06,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:06,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-11-23 14:26:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:06,230 INFO L225 Difference]: With dead ends: 497 [2022-11-23 14:26:06,230 INFO L226 Difference]: Without dead ends: 245 [2022-11-23 14:26:06,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-11-23 14:26:06,231 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 46 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:06,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 9 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:06,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-11-23 14:26:06,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2022-11-23 14:26:06,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 244 states have (on average 2.762295081967213) internal successors, (674), 244 states have internal predecessors, (674), 0 states have call successors, (0), 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-23 14:26:06,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 674 transitions. [2022-11-23 14:26:06,241 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 674 transitions. Word has length 14 [2022-11-23 14:26:06,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:06,241 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 674 transitions. [2022-11-23 14:26:06,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 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-23 14:26:06,241 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 674 transitions. [2022-11-23 14:26:06,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:26:06,242 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:06,244 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:06,245 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 14:26:06,245 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:06,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:06,245 INFO L85 PathProgramCache]: Analyzing trace with hash -32819341, now seen corresponding path program 1 times [2022-11-23 14:26:06,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:06,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268317826] [2022-11-23 14:26:06,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:06,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:07,958 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-23 14:26:07,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:07,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268317826] [2022-11-23 14:26:07,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268317826] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:07,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:07,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:26:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671288508] [2022-11-23 14:26:07,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:07,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:26:07,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:07,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:26:07,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:07,963 INFO L87 Difference]: Start difference. First operand 245 states and 674 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:08,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:08,480 INFO L93 Difference]: Finished difference Result 395 states and 1082 transitions. [2022-11-23 14:26:08,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:26:08,482 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 14:26:08,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:08,485 INFO L225 Difference]: With dead ends: 395 [2022-11-23 14:26:08,485 INFO L226 Difference]: Without dead ends: 351 [2022-11-23 14:26:08,486 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:08,487 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 60 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:08,487 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 6 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-23 14:26:08,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-11-23 14:26:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 333. [2022-11-23 14:26:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 332 states have (on average 2.7439759036144578) internal successors, (911), 332 states have internal predecessors, (911), 0 states have call successors, (0), 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-23 14:26:08,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 911 transitions. [2022-11-23 14:26:08,504 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 911 transitions. Word has length 15 [2022-11-23 14:26:08,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:08,505 INFO L495 AbstractCegarLoop]: Abstraction has 333 states and 911 transitions. [2022-11-23 14:26:08,505 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 911 transitions. [2022-11-23 14:26:08,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-23 14:26:08,507 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:08,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:08,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 14:26:08,508 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:08,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:08,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1079981319, now seen corresponding path program 2 times [2022-11-23 14:26:08,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:08,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391877478] [2022-11-23 14:26:08,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:08,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:08,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:09,730 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-23 14:26:09,730 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:09,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391877478] [2022-11-23 14:26:09,731 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391877478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:09,731 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:09,731 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:26:09,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889430143] [2022-11-23 14:26:09,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:09,732 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 14:26:09,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:09,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 14:26:09,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:09,734 INFO L87 Difference]: Start difference. First operand 333 states and 911 transitions. Second operand has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:10,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:10,038 INFO L93 Difference]: Finished difference Result 365 states and 972 transitions. [2022-11-23 14:26:10,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:26:10,039 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-11-23 14:26:10,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:10,041 INFO L225 Difference]: With dead ends: 365 [2022-11-23 14:26:10,041 INFO L226 Difference]: Without dead ends: 329 [2022-11-23 14:26:10,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:10,042 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 27 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:10,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 7 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:10,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2022-11-23 14:26:10,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 328. [2022-11-23 14:26:10,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 327 states have (on average 2.72782874617737) internal successors, (892), 327 states have internal predecessors, (892), 0 states have call successors, (0), 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-23 14:26:10,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 892 transitions. [2022-11-23 14:26:10,057 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 892 transitions. Word has length 15 [2022-11-23 14:26:10,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:10,057 INFO L495 AbstractCegarLoop]: Abstraction has 328 states and 892 transitions. [2022-11-23 14:26:10,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:10,057 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 892 transitions. [2022-11-23 14:26:10,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 14:26:10,058 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:10,058 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:10,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 14:26:10,059 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:10,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:10,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1634216203, now seen corresponding path program 1 times [2022-11-23 14:26:10,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:10,060 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408191839] [2022-11-23 14:26:10,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:10,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:10,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:11,766 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-23 14:26:11,766 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:11,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408191839] [2022-11-23 14:26:11,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408191839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:11,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:11,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 14:26:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556324589] [2022-11-23 14:26:11,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:11,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 14:26:11,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 14:26:11,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-11-23 14:26:11,768 INFO L87 Difference]: Start difference. First operand 328 states and 892 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:12,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:12,167 INFO L93 Difference]: Finished difference Result 373 states and 1001 transitions. [2022-11-23 14:26:12,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 14:26:12,168 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-11-23 14:26:12,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:12,170 INFO L225 Difference]: With dead ends: 373 [2022-11-23 14:26:12,170 INFO L226 Difference]: Without dead ends: 337 [2022-11-23 14:26:12,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:26:12,171 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 4 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:12,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 4 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:26:12,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-11-23 14:26:12,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 233. [2022-11-23 14:26:12,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 232 states have (on average 2.689655172413793) internal successors, (624), 232 states have internal predecessors, (624), 0 states have call successors, (0), 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-23 14:26:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 624 transitions. [2022-11-23 14:26:12,181 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 624 transitions. Word has length 16 [2022-11-23 14:26:12,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:12,181 INFO L495 AbstractCegarLoop]: Abstraction has 233 states and 624 transitions. [2022-11-23 14:26:12,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:12,181 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 624 transitions. [2022-11-23 14:26:12,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:26:12,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:12,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:12,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 14:26:12,183 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:12,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1477875198, now seen corresponding path program 1 times [2022-11-23 14:26:12,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:12,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852265625] [2022-11-23 14:26:12,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:12,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:14,258 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-23 14:26:14,258 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:14,258 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852265625] [2022-11-23 14:26:14,258 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852265625] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:14,259 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:14,259 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:26:14,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218395614] [2022-11-23 14:26:14,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:14,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:26:14,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:14,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:26:14,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:14,260 INFO L87 Difference]: Start difference. First operand 233 states and 624 transitions. Second operand has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-23 14:26:14,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:14,637 INFO L93 Difference]: Finished difference Result 274 states and 725 transitions. [2022-11-23 14:26:14,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:14,637 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-23 14:26:14,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:14,639 INFO L225 Difference]: With dead ends: 274 [2022-11-23 14:26:14,639 INFO L226 Difference]: Without dead ends: 252 [2022-11-23 14:26:14,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:26:14,640 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 54 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:14,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 6 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:26:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-11-23 14:26:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 234. [2022-11-23 14:26:14,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 233 states have (on average 2.6909871244635193) internal successors, (627), 233 states have internal predecessors, (627), 0 states have call successors, (0), 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-23 14:26:14,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 627 transitions. [2022-11-23 14:26:14,651 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 627 transitions. Word has length 17 [2022-11-23 14:26:14,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:14,652 INFO L495 AbstractCegarLoop]: Abstraction has 234 states and 627 transitions. [2022-11-23 14:26:14,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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-23 14:26:14,652 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 627 transitions. [2022-11-23 14:26:14,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-23 14:26:14,653 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:14,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:14,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 14:26:14,654 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:14,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:14,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1477888652, now seen corresponding path program 1 times [2022-11-23 14:26:14,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:14,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516241257] [2022-11-23 14:26:14,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:14,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:14,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:14,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-23 14:26:14,960 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:14,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516241257] [2022-11-23 14:26:14,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516241257] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:14,961 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:14,961 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 14:26:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39315892] [2022-11-23 14:26:14,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:14,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 14:26:14,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 14:26:14,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 14:26:14,963 INFO L87 Difference]: Start difference. First operand 234 states and 627 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-23 14:26:15,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:15,123 INFO L93 Difference]: Finished difference Result 225 states and 529 transitions. [2022-11-23 14:26:15,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 14:26:15,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-23 14:26:15,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:15,125 INFO L225 Difference]: With dead ends: 225 [2022-11-23 14:26:15,125 INFO L226 Difference]: Without dead ends: 172 [2022-11-23 14:26:15,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:15,126 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:15,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 8 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-11-23 14:26:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-11-23 14:26:15,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 2.3333333333333335) internal successors, (399), 171 states have internal predecessors, (399), 0 states have call successors, (0), 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-23 14:26:15,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 399 transitions. [2022-11-23 14:26:15,136 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 399 transitions. Word has length 17 [2022-11-23 14:26:15,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:15,137 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 399 transitions. [2022-11-23 14:26:15,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 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-23 14:26:15,137 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 399 transitions. [2022-11-23 14:26:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:26:15,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:15,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:15,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 14:26:15,139 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:15,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:15,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1133026618, now seen corresponding path program 1 times [2022-11-23 14:26:15,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:15,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [131410777] [2022-11-23 14:26:15,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:15,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:16,759 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-23 14:26:16,759 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:16,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [131410777] [2022-11-23 14:26:16,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [131410777] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:16,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:16,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:26:16,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248282204] [2022-11-23 14:26:16,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:16,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:26:16,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:16,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:26:16,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:16,761 INFO L87 Difference]: Start difference. First operand 172 states and 399 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:17,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:17,156 INFO L93 Difference]: Finished difference Result 210 states and 480 transitions. [2022-11-23 14:26:17,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:17,157 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 14:26:17,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:17,158 INFO L225 Difference]: With dead ends: 210 [2022-11-23 14:26:17,159 INFO L226 Difference]: Without dead ends: 192 [2022-11-23 14:26:17,159 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:26:17,160 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 45 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:17,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 6 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:26:17,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-11-23 14:26:17,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 186. [2022-11-23 14:26:17,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 185 states have (on average 2.3675675675675674) internal successors, (438), 185 states have internal predecessors, (438), 0 states have call successors, (0), 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-23 14:26:17,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 438 transitions. [2022-11-23 14:26:17,169 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 438 transitions. Word has length 18 [2022-11-23 14:26:17,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:17,170 INFO L495 AbstractCegarLoop]: Abstraction has 186 states and 438 transitions. [2022-11-23 14:26:17,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:17,170 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 438 transitions. [2022-11-23 14:26:17,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:26:17,171 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:17,171 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:17,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 14:26:17,172 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:17,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:17,173 INFO L85 PathProgramCache]: Analyzing trace with hash -1966078475, now seen corresponding path program 1 times [2022-11-23 14:26:17,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:17,173 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505750552] [2022-11-23 14:26:17,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:17,173 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:18,768 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-23 14:26:18,768 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:18,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505750552] [2022-11-23 14:26:18,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505750552] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:18,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:18,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:26:18,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553745075] [2022-11-23 14:26:18,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:18,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:26:18,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:18,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:26:18,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:18,770 INFO L87 Difference]: Start difference. First operand 186 states and 438 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:19,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:19,198 INFO L93 Difference]: Finished difference Result 193 states and 445 transitions. [2022-11-23 14:26:19,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:19,199 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 14:26:19,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:19,200 INFO L225 Difference]: With dead ends: 193 [2022-11-23 14:26:19,201 INFO L226 Difference]: Without dead ends: 184 [2022-11-23 14:26:19,201 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:26:19,201 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 21 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:19,202 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 12 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-23 14:26:19,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-11-23 14:26:19,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-11-23 14:26:19,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 179 states have (on average 2.35195530726257) internal successors, (421), 179 states have internal predecessors, (421), 0 states have call successors, (0), 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-23 14:26:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 421 transitions. [2022-11-23 14:26:19,210 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 421 transitions. Word has length 18 [2022-11-23 14:26:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:19,211 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 421 transitions. [2022-11-23 14:26:19,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 421 transitions. [2022-11-23 14:26:19,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 14:26:19,212 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:19,212 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:19,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-23 14:26:19,213 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:19,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:19,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1922539581, now seen corresponding path program 1 times [2022-11-23 14:26:19,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:19,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803837266] [2022-11-23 14:26:19,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:19,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:19,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:19,539 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-23 14:26:19,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:19,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803837266] [2022-11-23 14:26:19,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803837266] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:19,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:19,541 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 14:26:19,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918169868] [2022-11-23 14:26:19,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:19,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 14:26:19,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:19,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 14:26:19,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 14:26:19,543 INFO L87 Difference]: Start difference. First operand 180 states and 421 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:19,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:19,743 INFO L93 Difference]: Finished difference Result 142 states and 289 transitions. [2022-11-23 14:26:19,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 14:26:19,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-11-23 14:26:19,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:19,745 INFO L225 Difference]: With dead ends: 142 [2022-11-23 14:26:19,745 INFO L226 Difference]: Without dead ends: 107 [2022-11-23 14:26:19,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:26:19,746 INFO L413 NwaCegarLoop]: 3 mSDtfsCounter, 44 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:19,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 7 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:19,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-11-23 14:26:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 105. [2022-11-23 14:26:19,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.9423076923076923) internal successors, (202), 104 states have internal predecessors, (202), 0 states have call successors, (0), 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-23 14:26:19,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 202 transitions. [2022-11-23 14:26:19,754 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 202 transitions. Word has length 18 [2022-11-23 14:26:19,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:19,755 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 202 transitions. [2022-11-23 14:26:19,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:19,756 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 202 transitions. [2022-11-23 14:26:19,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:26:19,757 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:19,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:19,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-23 14:26:19,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:19,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:19,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1778509460, now seen corresponding path program 1 times [2022-11-23 14:26:19,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:19,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462016370] [2022-11-23 14:26:19,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:19,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:22,865 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-23 14:26:22,865 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:22,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462016370] [2022-11-23 14:26:22,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462016370] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:22,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:22,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-23 14:26:22,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859298656] [2022-11-23 14:26:22,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:22,866 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-23 14:26:22,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:22,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-23 14:26:22,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-11-23 14:26:22,867 INFO L87 Difference]: Start difference. First operand 105 states and 202 transitions. Second operand has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:23,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:23,205 INFO L93 Difference]: Finished difference Result 116 states and 222 transitions. [2022-11-23 14:26:23,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:23,206 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 14:26:23,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:23,207 INFO L225 Difference]: With dead ends: 116 [2022-11-23 14:26:23,207 INFO L226 Difference]: Without dead ends: 113 [2022-11-23 14:26:23,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-11-23 14:26:23,208 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 44 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 6 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:23,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 6 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 14:26:23,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-11-23 14:26:23,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 107. [2022-11-23 14:26:23,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.9528301886792452) internal successors, (207), 106 states have internal predecessors, (207), 0 states have call successors, (0), 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-23 14:26:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 207 transitions. [2022-11-23 14:26:23,212 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 207 transitions. Word has length 20 [2022-11-23 14:26:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:23,213 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 207 transitions. [2022-11-23 14:26:23,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 207 transitions. [2022-11-23 14:26:23,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-11-23 14:26:23,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:23,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:23,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-23 14:26:23,214 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:23,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:23,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1372160220, now seen corresponding path program 1 times [2022-11-23 14:26:23,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:23,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142098923] [2022-11-23 14:26:23,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:23,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:23,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 14:26:23,500 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-23 14:26:23,500 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 14:26:23,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142098923] [2022-11-23 14:26:23,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142098923] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 14:26:23,501 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 14:26:23,501 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 14:26:23,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697691491] [2022-11-23 14:26:23,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 14:26:23,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 14:26:23,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 14:26:23,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 14:26:23,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 14:26:23,503 INFO L87 Difference]: Start difference. First operand 107 states and 207 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:23,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 14:26:23,654 INFO L93 Difference]: Finished difference Result 87 states and 165 transitions. [2022-11-23 14:26:23,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 14:26:23,654 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-11-23 14:26:23,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 14:26:23,655 INFO L225 Difference]: With dead ends: 87 [2022-11-23 14:26:23,655 INFO L226 Difference]: Without dead ends: 77 [2022-11-23 14:26:23,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-11-23 14:26:23,656 INFO L413 NwaCegarLoop]: 2 mSDtfsCounter, 38 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 5 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 14:26:23,656 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 5 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 14:26:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-11-23 14:26:23,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-11-23 14:26:23,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 70 states have (on average 1.9142857142857144) internal successors, (134), 70 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 134 transitions. [2022-11-23 14:26:23,659 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 134 transitions. Word has length 20 [2022-11-23 14:26:23,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 14:26:23,659 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 134 transitions. [2022-11-23 14:26:23,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-23 14:26:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 134 transitions. [2022-11-23 14:26:23,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-23 14:26:23,660 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 14:26:23,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:23,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-23 14:26:23,660 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 3 more)] === [2022-11-23 14:26:23,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 14:26:23,661 INFO L85 PathProgramCache]: Analyzing trace with hash -633743412, now seen corresponding path program 1 times [2022-11-23 14:26:23,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 14:26:23,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827285658] [2022-11-23 14:26:23,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 14:26:23,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 14:26:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:26:23,778 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 14:26:23,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 14:26:23,913 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 14:26:23,913 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 14:26:23,915 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2022-11-23 14:26:23,917 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2022-11-23 14:26:23,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 6 remaining) [2022-11-23 14:26:23,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 6 remaining) [2022-11-23 14:26:23,918 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining) [2022-11-23 14:26:23,919 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2022-11-23 14:26:23,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-23 14:26:23,922 INFO L444 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 14:26:23,928 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 14:26:23,928 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 14:26:24,050 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 02:26:24 BasicIcfg [2022-11-23 14:26:24,050 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 14:26:24,051 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 14:26:24,059 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 14:26:24,060 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 14:26:24,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 02:25:47" (3/4) ... [2022-11-23 14:26:24,062 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 14:26:24,183 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 14:26:24,184 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 14:26:24,190 INFO L158 Benchmark]: Toolchain (without parser) took 38760.41ms. Allocated memory was 132.1MB in the beginning and 534.8MB in the end (delta: 402.7MB). Free memory was 87.7MB in the beginning and 271.1MB in the end (delta: -183.4MB). Peak memory consumption was 221.8MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,190 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 132.1MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 14:26:24,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 834.94ms. Allocated memory is still 132.1MB. Free memory was 87.2MB in the beginning and 63.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,192 INFO L158 Benchmark]: Boogie Procedure Inliner took 108.22ms. Allocated memory is still 132.1MB. Free memory was 63.0MB in the beginning and 60.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,192 INFO L158 Benchmark]: Boogie Preprocessor took 76.64ms. Allocated memory is still 132.1MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,192 INFO L158 Benchmark]: RCFGBuilder took 1435.59ms. Allocated memory is still 132.1MB. Free memory was 58.3MB in the beginning and 42.7MB in the end (delta: 15.6MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,193 INFO L158 Benchmark]: TraceAbstraction took 36155.43ms. Allocated memory was 132.1MB in the beginning and 534.8MB in the end (delta: 402.7MB). Free memory was 42.1MB in the beginning and 289.9MB in the end (delta: -247.9MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,193 INFO L158 Benchmark]: Witness Printer took 138.43ms. Allocated memory is still 534.8MB. Free memory was 289.9MB in the beginning and 271.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 14:26:24,195 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.36ms. Allocated memory is still 132.1MB. Free memory is still 102.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 834.94ms. Allocated memory is still 132.1MB. Free memory was 87.2MB in the beginning and 63.0MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 108.22ms. Allocated memory is still 132.1MB. Free memory was 63.0MB in the beginning and 60.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.64ms. Allocated memory is still 132.1MB. Free memory was 60.4MB in the beginning and 58.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1435.59ms. Allocated memory is still 132.1MB. Free memory was 58.3MB in the beginning and 42.7MB in the end (delta: 15.6MB). Peak memory consumption was 24.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36155.43ms. Allocated memory was 132.1MB in the beginning and 534.8MB in the end (delta: 402.7MB). Free memory was 42.1MB in the beginning and 289.9MB in the end (delta: -247.9MB). Peak memory consumption was 155.7MB. Max. memory is 16.1GB. * Witness Printer took 138.43ms. Allocated memory is still 534.8MB. Free memory was 289.9MB in the beginning and 271.1MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 12.9s, 142 PlacesBefore, 37 PlacesAfterwards, 134 TransitionsBefore, 28 TransitionsAfterwards, 2096 CoEnabledTransitionPairs, 7 FixpointIterations, 60 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 119 TotalNumberOfCompositions, 6201 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2369, independent: 2151, independent conditional: 0, independent unconditional: 2151, dependent: 218, dependent conditional: 0, dependent unconditional: 218, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1438, independent: 1373, independent conditional: 0, independent unconditional: 1373, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1438, independent: 1357, independent conditional: 0, independent unconditional: 1357, dependent: 81, dependent conditional: 0, dependent unconditional: 81, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 81, independent: 16, independent conditional: 0, independent unconditional: 16, dependent: 65, dependent conditional: 0, dependent unconditional: 65, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 1078, independent: 39, independent conditional: 0, independent unconditional: 39, dependent: 1039, dependent conditional: 0, dependent unconditional: 1039, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2369, independent: 778, independent conditional: 0, independent unconditional: 778, dependent: 153, dependent conditional: 0, dependent unconditional: 153, unknown: 1438, unknown conditional: 0, unknown unconditional: 1438] , Statistics on independence cache: Total cache size (in pairs): 135, Positive cache size: 100, Positive conditional cache size: 0, Positive unconditional cache size: 100, Negative cache size: 35, Negative conditional cache size: 0, Negative unconditional cache size: 35, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - 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: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p0_EAX = 0; [L713] 0 int __unbuffered_p1_EAX = 0; [L714] 0 _Bool __unbuffered_p1_EAX$flush_delayed; [L715] 0 int __unbuffered_p1_EAX$mem_tmp; [L716] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd0; [L717] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd1; [L718] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd2; [L719] 0 _Bool __unbuffered_p1_EAX$r_buff0_thd3; [L720] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd0; [L721] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd1; [L722] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd2; [L723] 0 _Bool __unbuffered_p1_EAX$r_buff1_thd3; [L724] 0 _Bool __unbuffered_p1_EAX$read_delayed; [L725] 0 int *__unbuffered_p1_EAX$read_delayed_var; [L726] 0 int __unbuffered_p1_EAX$w_buff0; [L727] 0 _Bool __unbuffered_p1_EAX$w_buff0_used; [L728] 0 int __unbuffered_p1_EAX$w_buff1; [L729] 0 _Bool __unbuffered_p1_EAX$w_buff1_used; [L731] 0 int __unbuffered_p2_EAX = 0; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L736] 0 _Bool x$flush_delayed; [L737] 0 int x$mem_tmp; [L738] 0 _Bool x$r_buff0_thd0; [L739] 0 _Bool x$r_buff0_thd1; [L740] 0 _Bool x$r_buff0_thd2; [L741] 0 _Bool x$r_buff0_thd3; [L742] 0 _Bool x$r_buff1_thd0; [L743] 0 _Bool x$r_buff1_thd1; [L744] 0 _Bool x$r_buff1_thd2; [L745] 0 _Bool x$r_buff1_thd3; [L746] 0 _Bool x$read_delayed; [L747] 0 int *x$read_delayed_var; [L748] 0 int x$w_buff0; [L749] 0 _Bool x$w_buff0_used; [L750] 0 int x$w_buff1; [L751] 0 _Bool x$w_buff1_used; [L753] 0 int y = 0; [L754] 0 _Bool weak$$choice0; [L755] 0 _Bool weak$$choice1; [L756] 0 _Bool weak$$choice2; [L853] 0 pthread_t t1780; [L854] FCALL, FORK 0 pthread_create(&t1780, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1780, ((void *)0), P0, ((void *)0))=-1, t1780={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L855] 0 pthread_t t1781; [L856] FCALL, FORK 0 pthread_create(&t1781, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1781, ((void *)0), P1, ((void *)0))=0, t1780={7:0}, t1781={8:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L857] 0 pthread_t t1782; [L858] FCALL, FORK 0 pthread_create(&t1782, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=0, __unbuffered_p1_EAX$read_delayed_var={0:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t1782, ((void *)0), P2, ((void *)0))=1, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L789] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L790] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L791] 2 x$flush_delayed = weak$$choice2 [L792] EXPR 2 \read(x) [L792] 2 x$mem_tmp = x [L793] 2 weak$$choice1 = __VERIFIER_nondet_bool() [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] EXPR 2 \read(x) [L794] EXPR 2 !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L794] 2 x = !x$w_buff0_used ? x : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x : (weak$$choice1 ? x$w_buff0 : x$w_buff1)) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$w_buff1 : x$w_buff0) : (weak$$choice0 ? x$w_buff0 : x)))) [L795] 2 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff0 : x$w_buff0)))) [L796] 2 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$w_buff1 : x$w_buff1)))) [L797] 2 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 || !weak$$choice1 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : weak$$choice0)))) [L798] 2 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? weak$$choice0 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L799] 2 x$r_buff0_thd2 = weak$$choice2 ? x$r_buff0_thd2 : (!x$w_buff0_used ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? x$r_buff0_thd2 : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L800] 2 x$r_buff1_thd2 = weak$$choice2 ? x$r_buff1_thd2 : (!x$w_buff0_used ? x$r_buff1_thd2 : (x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : (x$w_buff0_used && !x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (weak$$choice0 ? x$r_buff1_thd2 : (_Bool)0) : (x$w_buff0_used && x$r_buff1_thd2 && x$w_buff1_used && !x$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)))) [L801] 2 __unbuffered_p1_EAX$read_delayed = (_Bool)1 [L802] 2 __unbuffered_p1_EAX$read_delayed_var = &x [L803] EXPR 2 \read(x) [L803] 2 __unbuffered_p1_EAX = x [L804] EXPR 2 x$flush_delayed ? x$mem_tmp : x [L804] 2 x = x$flush_delayed ? x$mem_tmp : x [L805] 2 x$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L808] 2 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 \read(x) [L811] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L811] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L811] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L812] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L813] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L814] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L815] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L818] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L820] 2 return 0; [L825] 3 __unbuffered_p2_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1] [L828] 3 y = 2 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 \read(x) [L831] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L831] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L831] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L832] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L833] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L834] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L835] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L838] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L840] 3 return 0; [L760] 1 __unbuffered_p0_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L763] 1 x$w_buff1 = x$w_buff0 [L764] 1 x$w_buff0 = 1 [L765] 1 x$w_buff1_used = x$w_buff0_used [L766] 1 x$w_buff0_used = (_Bool)1 [L767] CALL 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L767] RET 1 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L768] 1 x$r_buff1_thd0 = x$r_buff0_thd0 [L769] 1 x$r_buff1_thd1 = x$r_buff0_thd1 [L770] 1 x$r_buff1_thd2 = x$r_buff0_thd2 [L771] 1 x$r_buff1_thd3 = x$r_buff0_thd3 [L772] 1 x$r_buff0_thd1 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L775] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L775] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L776] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L777] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L778] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L779] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L784] 1 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L862] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L862] RET 0 assume_abort_if_not(main$tmp_guard0) [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 \read(x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=0, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t1780={7:0}, t1781={8:0}, t1782={5:0}, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L871] 0 weak$$choice1 = __VERIFIER_nondet_bool() [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 \read(*__unbuffered_p1_EAX$read_delayed_var) [L872] EXPR 0 weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX [L872] EXPR 0 __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L872] 0 __unbuffered_p1_EAX = __unbuffered_p1_EAX$read_delayed ? (weak$$choice1 ? *__unbuffered_p1_EAX$read_delayed_var : __unbuffered_p1_EAX) : __unbuffered_p1_EAX [L873] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p1_EAX == 1 && __unbuffered_p2_EAX == 1) [L875] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [#in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p1_EAX=1, __unbuffered_p1_EAX$flush_delayed=0, __unbuffered_p1_EAX$mem_tmp=0, __unbuffered_p1_EAX$r_buff0_thd0=0, __unbuffered_p1_EAX$r_buff0_thd1=0, __unbuffered_p1_EAX$r_buff0_thd2=0, __unbuffered_p1_EAX$r_buff0_thd3=0, __unbuffered_p1_EAX$r_buff1_thd0=0, __unbuffered_p1_EAX$r_buff1_thd1=0, __unbuffered_p1_EAX$r_buff1_thd2=0, __unbuffered_p1_EAX$r_buff1_thd3=0, __unbuffered_p1_EAX$read_delayed=1, __unbuffered_p1_EAX$read_delayed_var={3:0}, __unbuffered_p1_EAX$w_buff0=0, __unbuffered_p1_EAX$w_buff0_used=0, __unbuffered_p1_EAX$w_buff1=0, __unbuffered_p1_EAX$w_buff1_used=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=0, weak$$choice1=1, weak$$choice2=255, x={3:0}, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=1, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - UnprovableResult [Line: 18]: 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: 858]: 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: 856]: 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: 854]: 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 7 procedures, 161 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 35.7s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 13.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 630 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 630 mSDsluCounter, 129 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 163 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1858 IncrementalHoareTripleChecker+Invalid, 2021 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 163 mSolverCounterUnsat, 49 mSDtfsCounter, 1858 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=899occurred in iteration=0, InterpolantAutomatonStates: 106, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 17 MinimizatonAttempts, 165 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 15.2s InterpolantComputationTime, 274 NumberOfCodeBlocks, 274 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 235 ConstructedInterpolants, 0 QuantifiedInterpolants, 3597 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-23 14:26:24,230 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_0db3c2ae-8afb-44e5-80cf-848a02484c47/bin/utaipan-Q6hlc19bkW/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