./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread-wmm/mix004.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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/config/TaipanReach.xml -i ../../sv-benchmarks/c/pthread-wmm/mix004.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/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 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d --- 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 15:34:52,099 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-23 15:34:52,102 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-23 15:34:52,127 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-23 15:34:52,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-23 15:34:52,129 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-23 15:34:52,130 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-23 15:34:52,133 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-23 15:34:52,134 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-23 15:34:52,136 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-23 15:34:52,137 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-23 15:34:52,138 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-23 15:34:52,139 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-23 15:34:52,140 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-23 15:34:52,142 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-23 15:34:52,143 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-23 15:34:52,144 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-23 15:34:52,146 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-23 15:34:52,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-23 15:34:52,150 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-23 15:34:52,152 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-23 15:34:52,154 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-23 15:34:52,156 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-23 15:34:52,157 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-23 15:34:52,162 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-23 15:34:52,163 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-23 15:34:52,163 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-23 15:34:52,164 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-23 15:34:52,165 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-23 15:34:52,166 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-23 15:34:52,167 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-23 15:34:52,168 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-23 15:34:52,169 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-23 15:34:52,170 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-23 15:34:52,172 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-23 15:34:52,172 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-23 15:34:52,173 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-23 15:34:52,174 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-23 15:34:52,174 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-23 15:34:52,175 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-23 15:34:52,176 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-23 15:34:52,178 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/config/svcomp-Reach-32bit-Taipan_Default.epf [2022-11-23 15:34:52,208 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-23 15:34:52,208 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-23 15:34:52,209 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-23 15:34:52,209 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-23 15:34:52,210 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-23 15:34:52,211 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-23 15:34:52,211 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-23 15:34:52,211 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-23 15:34:52,212 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-23 15:34:52,212 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-23 15:34:52,213 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-23 15:34:52,213 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-23 15:34:52,213 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-23 15:34:52,214 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-23 15:34:52,214 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-23 15:34:52,214 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-23 15:34:52,215 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-23 15:34:52,215 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-23 15:34:52,216 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-23 15:34:52,216 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-23 15:34:52,217 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-23 15:34:52,217 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-23 15:34:52,217 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-23 15:34:52,218 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-23 15:34:52,218 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-23 15:34:52,218 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-23 15:34:52,218 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-23 15:34:52,219 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-23 15:34:52,219 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-23 15:34:52,219 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-23 15:34:52,220 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-23 15:34:52,220 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-23 15:34:52,220 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:34:52,221 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-23 15:34:52,221 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-23 15:34:52,221 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-23 15:34:52,222 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-23 15:34:52,222 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-23 15:34:52,222 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-23 15:34:52,222 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-23 15:34:52,223 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-23 15:34:52,223 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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/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 -> 89021de777f0aa5756284679b7b3bd19ab661d8d626f08ad7f7db0bc955b507d [2022-11-23 15:34:52,555 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-23 15:34:52,602 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-23 15:34:52,606 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-23 15:34:52,607 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-23 15:34:52,608 INFO L275 PluginConnector]: CDTParser initialized [2022-11-23 15:34:52,609 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/../../sv-benchmarks/c/pthread-wmm/mix004.opt.i [2022-11-23 15:34:56,096 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-23 15:34:56,421 INFO L351 CDTParser]: Found 1 translation units. [2022-11-23 15:34:56,422 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/sv-benchmarks/c/pthread-wmm/mix004.opt.i [2022-11-23 15:34:56,439 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/data/5019cbc0a/e5b8ff232de74f02a493b10126912fe2/FLAGea1ffb40a [2022-11-23 15:34:56,457 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/data/5019cbc0a/e5b8ff232de74f02a493b10126912fe2 [2022-11-23 15:34:56,460 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-23 15:34:56,462 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-23 15:34:56,463 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-23 15:34:56,464 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-23 15:34:56,475 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-23 15:34:56,477 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:56" (1/1) ... [2022-11-23 15:34:56,478 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7331434 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:56, skipping insertion in model container [2022-11-23 15:34:56,479 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:34:56" (1/1) ... [2022-11-23 15:34:56,490 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-23 15:34:56,546 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-23 15:34:56,843 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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2022-11-23 15:34:57,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:34:57,272 INFO L203 MainTranslator]: Completed pre-run [2022-11-23 15:34:57,290 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_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/sv-benchmarks/c/pthread-wmm/mix004.opt.i[944,957] [2022-11-23 15:34:57,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-23 15:34:57,428 INFO L208 MainTranslator]: Completed translation [2022-11-23 15:34:57,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57 WrapperNode [2022-11-23 15:34:57,429 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-23 15:34:57,431 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-23 15:34:57,431 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-23 15:34:57,431 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-23 15:34:57,441 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,493 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,525 INFO L138 Inliner]: procedures = 177, calls = 71, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 165 [2022-11-23 15:34:57,526 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-23 15:34:57,527 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-23 15:34:57,527 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-23 15:34:57,527 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-23 15:34:57,538 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,543 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,543 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,552 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,554 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,563 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,569 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-23 15:34:57,570 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-23 15:34:57,570 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-23 15:34:57,570 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-23 15:34:57,572 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (1/1) ... [2022-11-23 15:34:57,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-23 15:34:57,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/z3 [2022-11-23 15:34:57,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-23 15:34:57,666 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-23 15:34:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-23 15:34:57,714 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-23 15:34:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-23 15:34:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-23 15:34:57,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-23 15:34:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2022-11-23 15:34:57,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2022-11-23 15:34:57,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2022-11-23 15:34:57,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2022-11-23 15:34:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2022-11-23 15:34:57,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2022-11-23 15:34:57,717 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2022-11-23 15:34:57,718 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2022-11-23 15:34:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-23 15:34:57,718 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-23 15:34:57,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-23 15:34:57,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-23 15:34:57,722 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 15:34:57,948 INFO L235 CfgBuilder]: Building ICFG [2022-11-23 15:34:57,950 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-23 15:34:58,527 INFO L276 CfgBuilder]: Performing block encoding [2022-11-23 15:34:58,862 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-23 15:34:58,863 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-23 15:34:58,867 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:58 BoogieIcfgContainer [2022-11-23 15:34:58,867 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-23 15:34:58,872 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-23 15:34:58,872 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-23 15:34:58,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-23 15:34:58,878 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 03:34:56" (1/3) ... [2022-11-23 15:34:58,879 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d4aed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:58, skipping insertion in model container [2022-11-23 15:34:58,879 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:34:57" (2/3) ... [2022-11-23 15:34:58,882 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9d4aed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 03:34:58, skipping insertion in model container [2022-11-23 15:34:58,882 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:58" (3/3) ... [2022-11-23 15:34:58,893 INFO L112 eAbstractionObserver]: Analyzing ICFG mix004.opt.i [2022-11-23 15:34:58,906 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-23 15:34:58,919 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-23 15:34:58,919 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-11-23 15:34:58,919 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-23 15:34:59,000 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2022-11-23 15:34:59,044 INFO L115 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2022-11-23 15:34:59,063 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 149 places, 138 transitions, 296 flow [2022-11-23 15:34:59,067 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 149 places, 138 transitions, 296 flow [2022-11-23 15:34:59,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 149 places, 138 transitions, 296 flow [2022-11-23 15:34:59,139 INFO L130 PetriNetUnfolder]: 2/134 cut-off events. [2022-11-23 15:34:59,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2022-11-23 15:34:59,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 147 conditions, 134 events. 2/134 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 67 event pairs, 0 based on Foata normal form. 0/130 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2022-11-23 15:34:59,150 INFO L119 LiptonReduction]: Number of co-enabled transitions 3060 [2022-11-23 15:35:06,298 INFO L134 LiptonReduction]: Checked pairs total: 7493 [2022-11-23 15:35:06,298 INFO L136 LiptonReduction]: Total number of compositions: 118 [2022-11-23 15:35:06,307 INFO L113 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 46 places, 34 transitions, 88 flow [2022-11-23 15:35:06,546 INFO L135 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 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 15:35:06,569 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-23 15:35:06,578 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;@3204f387, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-23 15:35:06,579 INFO L358 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2022-11-23 15:35:06,596 INFO L276 IsEmpty]: Start isEmpty. Operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 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 15:35:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-23 15:35:06,605 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:06,606 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:35:06,606 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting P3Err0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:06,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:06,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2089863199, now seen corresponding path program 1 times [2022-11-23 15:35:06,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:06,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176689908] [2022-11-23 15:35:06,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:06,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:06,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:07,397 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 15:35:07,398 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:07,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176689908] [2022-11-23 15:35:07,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176689908] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:07,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:07,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-23 15:35:07,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337878725] [2022-11-23 15:35:07,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:07,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-23 15:35:07,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:07,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-23 15:35:07,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-23 15:35:07,447 INFO L87 Difference]: Start difference. First operand has 3162 states, 3159 states have (on average 4.074707185818297) internal successors, (12872), 3161 states have internal predecessors, (12872), 0 states have call successors, (0), 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 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 15:35:07,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:07,655 INFO L93 Difference]: Finished difference Result 2682 states and 10328 transitions. [2022-11-23 15:35:07,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-23 15:35:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-11-23 15:35:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:07,717 INFO L225 Difference]: With dead ends: 2682 [2022-11-23 15:35:07,717 INFO L226 Difference]: Without dead ends: 2602 [2022-11-23 15:35:07,718 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 15:35:07,723 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 8 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:07,725 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 8 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:35:07,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2602 states. [2022-11-23 15:35:07,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2602 to 2602. [2022-11-23 15:35:07,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2602 states, 2601 states have (on average 3.869281045751634) internal successors, (10064), 2601 states have internal predecessors, (10064), 0 states have call successors, (0), 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 15:35:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2602 states to 2602 states and 10064 transitions. [2022-11-23 15:35:07,941 INFO L78 Accepts]: Start accepts. Automaton has 2602 states and 10064 transitions. Word has length 9 [2022-11-23 15:35:07,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:07,942 INFO L495 AbstractCegarLoop]: Abstraction has 2602 states and 10064 transitions. [2022-11-23 15:35:07,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 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 15:35:07,943 INFO L276 IsEmpty]: Start isEmpty. Operand 2602 states and 10064 transitions. [2022-11-23 15:35:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-23 15:35:07,946 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:07,947 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:35:07,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-23 15:35:07,948 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:07,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash -730504345, now seen corresponding path program 1 times [2022-11-23 15:35:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960419228] [2022-11-23 15:35:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:07,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:08,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:08,487 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 15:35:08,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:08,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960419228] [2022-11-23 15:35:08,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960419228] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:08,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:08,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:35:08,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879363640] [2022-11-23 15:35:08,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:08,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:35:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:35:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:35:08,500 INFO L87 Difference]: Start difference. First operand 2602 states and 10064 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 15:35:08,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:08,770 INFO L93 Difference]: Finished difference Result 3050 states and 11424 transitions. [2022-11-23 15:35:08,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:35:08,771 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 15:35:08,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:08,792 INFO L225 Difference]: With dead ends: 3050 [2022-11-23 15:35:08,793 INFO L226 Difference]: Without dead ends: 2570 [2022-11-23 15:35:08,794 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 15:35:08,795 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 28 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:08,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 12 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:08,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2570 states. [2022-11-23 15:35:08,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2570 to 2570. [2022-11-23 15:35:08,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2569 states have (on average 3.8551965745426235) internal successors, (9904), 2569 states have internal predecessors, (9904), 0 states have call successors, (0), 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 15:35:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 9904 transitions. [2022-11-23 15:35:08,943 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 9904 transitions. Word has length 12 [2022-11-23 15:35:08,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:08,943 INFO L495 AbstractCegarLoop]: Abstraction has 2570 states and 9904 transitions. [2022-11-23 15:35:08,944 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 15:35:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 9904 transitions. [2022-11-23 15:35:08,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:35:08,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:08,957 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:35:08,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-23 15:35:08,958 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:08,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:08,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1494361383, now seen corresponding path program 1 times [2022-11-23 15:35:08,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:08,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142872530] [2022-11-23 15:35:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:08,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:09,352 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 15:35:09,353 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:09,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142872530] [2022-11-23 15:35:09,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142872530] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:09,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:09,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:35:09,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147453124] [2022-11-23 15:35:09,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:09,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:35:09,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:09,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:35:09,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:35:09,359 INFO L87 Difference]: Start difference. First operand 2570 states and 9904 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 15:35:09,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:09,576 INFO L93 Difference]: Finished difference Result 2658 states and 9928 transitions. [2022-11-23 15:35:09,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:35:09,577 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 15:35:09,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:09,598 INFO L225 Difference]: With dead ends: 2658 [2022-11-23 15:35:09,598 INFO L226 Difference]: Without dead ends: 2218 [2022-11-23 15:35:09,599 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 15:35:09,602 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 37 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:09,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 18 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:09,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2022-11-23 15:35:09,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2218. [2022-11-23 15:35:09,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2218 states, 2217 states have (on average 3.7889039242219216) internal successors, (8400), 2217 states have internal predecessors, (8400), 0 states have call successors, (0), 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 15:35:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2218 states to 2218 states and 8400 transitions. [2022-11-23 15:35:09,708 INFO L78 Accepts]: Start accepts. Automaton has 2218 states and 8400 transitions. Word has length 14 [2022-11-23 15:35:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:09,708 INFO L495 AbstractCegarLoop]: Abstraction has 2218 states and 8400 transitions. [2022-11-23 15:35:09,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 15:35:09,709 INFO L276 IsEmpty]: Start isEmpty. Operand 2218 states and 8400 transitions. [2022-11-23 15:35:09,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-23 15:35:09,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:09,712 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:35:09,712 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-23 15:35:09,713 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:09,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:09,713 INFO L85 PathProgramCache]: Analyzing trace with hash 363110255, now seen corresponding path program 1 times [2022-11-23 15:35:09,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:09,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946844436] [2022-11-23 15:35:09,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:09,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:09,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:09,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 15:35:09,958 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:09,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946844436] [2022-11-23 15:35:09,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946844436] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:09,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:09,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-23 15:35:09,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420912349] [2022-11-23 15:35:09,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:09,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:35:09,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:09,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:35:09,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:35:09,962 INFO L87 Difference]: Start difference. First operand 2218 states and 8400 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 15:35:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:10,145 INFO L93 Difference]: Finished difference Result 2314 states and 8560 transitions. [2022-11-23 15:35:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:35:10,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 15:35:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:10,161 INFO L225 Difference]: With dead ends: 2314 [2022-11-23 15:35:10,161 INFO L226 Difference]: Without dead ends: 2026 [2022-11-23 15:35:10,162 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 15:35:10,163 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 31 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:10,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 18 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:35:10,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2022-11-23 15:35:10,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2022-11-23 15:35:10,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 2025 states have (on average 3.753086419753086) internal successors, (7600), 2025 states have internal predecessors, (7600), 0 states have call successors, (0), 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 15:35:10,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 7600 transitions. [2022-11-23 15:35:10,248 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 7600 transitions. Word has length 14 [2022-11-23 15:35:10,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:10,248 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 7600 transitions. [2022-11-23 15:35:10,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 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 15:35:10,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 7600 transitions. [2022-11-23 15:35:10,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-23 15:35:10,254 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:10,254 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:35:10,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-23 15:35:10,255 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:10,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:10,255 INFO L85 PathProgramCache]: Analyzing trace with hash 666598416, now seen corresponding path program 1 times [2022-11-23 15:35:10,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:10,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750846633] [2022-11-23 15:35:10,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:10,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:10,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:10,658 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 15:35:10,660 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:10,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750846633] [2022-11-23 15:35:10,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750846633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:10,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:10,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-23 15:35:10,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015679106] [2022-11-23 15:35:10,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:10,663 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-23 15:35:10,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:10,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-23 15:35:10,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-23 15:35:10,665 INFO L87 Difference]: Start difference. First operand 2026 states and 7600 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 15:35:10,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:10,828 INFO L93 Difference]: Finished difference Result 2038 states and 6944 transitions. [2022-11-23 15:35:10,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-23 15:35:10,829 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 15:35:10,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:10,843 INFO L225 Difference]: With dead ends: 2038 [2022-11-23 15:35:10,843 INFO L226 Difference]: Without dead ends: 1558 [2022-11-23 15:35:10,844 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 15:35:10,845 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 51 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 12 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:10,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 12 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:35:10,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-11-23 15:35:10,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2022-11-23 15:35:10,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 1557 states have (on average 3.378291586384072) internal successors, (5260), 1557 states have internal predecessors, (5260), 0 states have call successors, (0), 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 15:35:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 5260 transitions. [2022-11-23 15:35:10,927 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 5260 transitions. Word has length 16 [2022-11-23 15:35:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:10,928 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 5260 transitions. [2022-11-23 15:35:10,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 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 15:35:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 5260 transitions. [2022-11-23 15:35:10,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-23 15:35:10,934 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:10,934 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 15:35:10,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-23 15:35:10,934 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:10,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1657208108, now seen corresponding path program 1 times [2022-11-23 15:35:10,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:10,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754191025] [2022-11-23 15:35:10,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:10,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:11,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:11,354 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 15:35:11,354 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:11,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754191025] [2022-11-23 15:35:11,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754191025] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:11,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:11,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:35:11,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541393881] [2022-11-23 15:35:11,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:11,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:35:11,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:11,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:35:11,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:35:11,358 INFO L87 Difference]: Start difference. First operand 1558 states and 5260 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 15:35:11,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:11,554 INFO L93 Difference]: Finished difference Result 1294 states and 3989 transitions. [2022-11-23 15:35:11,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:35:11,555 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 15:35:11,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:11,562 INFO L225 Difference]: With dead ends: 1294 [2022-11-23 15:35:11,562 INFO L226 Difference]: Without dead ends: 994 [2022-11-23 15:35:11,563 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:35:11,563 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 104 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:11,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 16 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:11,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2022-11-23 15:35:11,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 994. [2022-11-23 15:35:11,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 994 states, 993 states have (on average 3.025176233635448) internal successors, (3004), 993 states have internal predecessors, (3004), 0 states have call successors, (0), 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 15:35:11,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 994 states to 994 states and 3004 transitions. [2022-11-23 15:35:11,621 INFO L78 Accepts]: Start accepts. Automaton has 994 states and 3004 transitions. Word has length 18 [2022-11-23 15:35:11,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:11,621 INFO L495 AbstractCegarLoop]: Abstraction has 994 states and 3004 transitions. [2022-11-23 15:35:11,621 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 15:35:11,622 INFO L276 IsEmpty]: Start isEmpty. Operand 994 states and 3004 transitions. [2022-11-23 15:35:11,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-11-23 15:35:11,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:11,625 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] [2022-11-23 15:35:11,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-23 15:35:11,626 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:11,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:11,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1837230806, now seen corresponding path program 1 times [2022-11-23 15:35:11,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:11,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346906184] [2022-11-23 15:35:11,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:11,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:11,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:11,980 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 15:35:11,980 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:11,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346906184] [2022-11-23 15:35:11,981 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346906184] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:11,981 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:11,981 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:35:11,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425326870] [2022-11-23 15:35:11,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:11,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:35:11,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:11,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:35:11,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:35:11,983 INFO L87 Difference]: Start difference. First operand 994 states and 3004 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 15:35:12,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:12,210 INFO L93 Difference]: Finished difference Result 837 states and 2500 transitions. [2022-11-23 15:35:12,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-23 15:35:12,210 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-11-23 15:35:12,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:12,216 INFO L225 Difference]: With dead ends: 837 [2022-11-23 15:35:12,216 INFO L226 Difference]: Without dead ends: 738 [2022-11-23 15:35:12,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:35:12,217 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 154 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:12,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 20 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:12,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 738 states. [2022-11-23 15:35:12,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 738 to 738. [2022-11-23 15:35:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 738 states, 737 states have (on average 3.033921302578019) internal successors, (2236), 737 states have internal predecessors, (2236), 0 states have call successors, (0), 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 15:35:12,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 738 states to 738 states and 2236 transitions. [2022-11-23 15:35:12,244 INFO L78 Accepts]: Start accepts. Automaton has 738 states and 2236 transitions. Word has length 21 [2022-11-23 15:35:12,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:12,245 INFO L495 AbstractCegarLoop]: Abstraction has 738 states and 2236 transitions. [2022-11-23 15:35:12,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 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 15:35:12,245 INFO L276 IsEmpty]: Start isEmpty. Operand 738 states and 2236 transitions. [2022-11-23 15:35:12,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-23 15:35:12,248 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:12,248 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, 1, 1] [2022-11-23 15:35:12,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-23 15:35:12,249 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:12,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:12,250 INFO L85 PathProgramCache]: Analyzing trace with hash -1377304822, now seen corresponding path program 1 times [2022-11-23 15:35:12,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:12,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111983574] [2022-11-23 15:35:12,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:12,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:12,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:12,673 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 15:35:12,673 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:12,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111983574] [2022-11-23 15:35:12,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111983574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:12,674 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:12,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-23 15:35:12,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955518585] [2022-11-23 15:35:12,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:12,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-23 15:35:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:12,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-23 15:35:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:35:12,676 INFO L87 Difference]: Start difference. First operand 738 states and 2236 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 15:35:12,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:12,905 INFO L93 Difference]: Finished difference Result 702 states and 2162 transitions. [2022-11-23 15:35:12,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:35:12,906 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2022-11-23 15:35:12,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:12,910 INFO L225 Difference]: With dead ends: 702 [2022-11-23 15:35:12,911 INFO L226 Difference]: Without dead ends: 686 [2022-11-23 15:35:12,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-11-23 15:35:12,911 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 158 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:12,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 16 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:12,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-11-23 15:35:12,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 686. [2022-11-23 15:35:12,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 685 states have (on average 3.1124087591240874) internal successors, (2132), 685 states have internal predecessors, (2132), 0 states have call successors, (0), 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 15:35:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 2132 transitions. [2022-11-23 15:35:12,937 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 2132 transitions. Word has length 24 [2022-11-23 15:35:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:12,938 INFO L495 AbstractCegarLoop]: Abstraction has 686 states and 2132 transitions. [2022-11-23 15:35:12,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 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 15:35:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 2132 transitions. [2022-11-23 15:35:12,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:35:12,941 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:12,942 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, 1, 1, 1, 1, 1] [2022-11-23 15:35:12,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-23 15:35:12,942 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:12,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:12,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1264867138, now seen corresponding path program 1 times [2022-11-23 15:35:12,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:12,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827419929] [2022-11-23 15:35:12,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:12,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:13,307 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 15:35:13,308 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:13,308 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827419929] [2022-11-23 15:35:13,308 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1827419929] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:13,308 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:13,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-23 15:35:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512978449] [2022-11-23 15:35:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:13,310 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-23 15:35:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:13,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-23 15:35:13,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-23 15:35:13,311 INFO L87 Difference]: Start difference. First operand 686 states and 2132 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:13,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:13,587 INFO L93 Difference]: Finished difference Result 869 states and 2654 transitions. [2022-11-23 15:35:13,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-23 15:35:13,588 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 15:35:13,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:13,590 INFO L225 Difference]: With dead ends: 869 [2022-11-23 15:35:13,590 INFO L226 Difference]: Without dead ends: 356 [2022-11-23 15:35:13,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:35:13,591 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 39 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:13,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 25 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:13,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-11-23 15:35:13,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2022-11-23 15:35:13,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 355 states have (on average 2.7859154929577463) internal successors, (989), 355 states have internal predecessors, (989), 0 states have call successors, (0), 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 15:35:13,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 989 transitions. [2022-11-23 15:35:13,605 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 989 transitions. Word has length 27 [2022-11-23 15:35:13,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:13,606 INFO L495 AbstractCegarLoop]: Abstraction has 356 states and 989 transitions. [2022-11-23 15:35:13,606 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:13,606 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 989 transitions. [2022-11-23 15:35:13,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:35:13,608 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:13,623 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, 1, 1, 1, 1, 1] [2022-11-23 15:35:13,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-23 15:35:13,624 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:13,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:13,625 INFO L85 PathProgramCache]: Analyzing trace with hash 416584886, now seen corresponding path program 2 times [2022-11-23 15:35:13,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:13,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722575589] [2022-11-23 15:35:13,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:13,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:14,030 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 15:35:14,031 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:14,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722575589] [2022-11-23 15:35:14,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722575589] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:14,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:14,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:35:14,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407480539] [2022-11-23 15:35:14,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:14,032 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:35:14,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:14,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:35:14,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:35:14,034 INFO L87 Difference]: Start difference. First operand 356 states and 989 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:14,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:14,225 INFO L93 Difference]: Finished difference Result 449 states and 1229 transitions. [2022-11-23 15:35:14,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:35:14,226 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 15:35:14,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:14,227 INFO L225 Difference]: With dead ends: 449 [2022-11-23 15:35:14,228 INFO L226 Difference]: Without dead ends: 185 [2022-11-23 15:35:14,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:35:14,229 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 19 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:14,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 23 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:14,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-11-23 15:35:14,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-11-23 15:35:14,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 184 states have (on average 2.472826086956522) internal successors, (455), 184 states have internal predecessors, (455), 0 states have call successors, (0), 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 15:35:14,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 455 transitions. [2022-11-23 15:35:14,245 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 455 transitions. Word has length 27 [2022-11-23 15:35:14,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:14,245 INFO L495 AbstractCegarLoop]: Abstraction has 185 states and 455 transitions. [2022-11-23 15:35:14,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:14,246 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 455 transitions. [2022-11-23 15:35:14,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:35:14,247 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:14,247 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, 1, 1, 1, 1, 1] [2022-11-23 15:35:14,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-23 15:35:14,248 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash -542373240, now seen corresponding path program 3 times [2022-11-23 15:35:14,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:14,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190637921] [2022-11-23 15:35:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:14,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:14,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:14,630 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 15:35:14,630 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:14,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190637921] [2022-11-23 15:35:14,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190637921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:14,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:14,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-23 15:35:14,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402402908] [2022-11-23 15:35:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:14,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-23 15:35:14,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:14,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-23 15:35:14,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-23 15:35:14,633 INFO L87 Difference]: Start difference. First operand 185 states and 455 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:14,807 INFO L93 Difference]: Finished difference Result 236 states and 574 transitions. [2022-11-23 15:35:14,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-23 15:35:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 15:35:14,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:14,808 INFO L225 Difference]: With dead ends: 236 [2022-11-23 15:35:14,808 INFO L226 Difference]: Without dead ends: 93 [2022-11-23 15:35:14,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-11-23 15:35:14,809 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 17 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:14,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 16 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-23 15:35:14,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-23 15:35:14,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-11-23 15:35:14,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.1630434782608696) internal successors, (199), 92 states have internal predecessors, (199), 0 states have call successors, (0), 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 15:35:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 199 transitions. [2022-11-23 15:35:14,813 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 199 transitions. Word has length 27 [2022-11-23 15:35:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:14,813 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 199 transitions. [2022-11-23 15:35:14,814 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:14,814 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 199 transitions. [2022-11-23 15:35:14,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:35:14,814 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:14,815 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, 1, 1, 1, 1, 1] [2022-11-23 15:35:14,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-23 15:35:14,815 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:14,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:14,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1548845768, now seen corresponding path program 4 times [2022-11-23 15:35:14,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:14,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23583548] [2022-11-23 15:35:14,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:14,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-23 15:35:17,087 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 15:35:17,087 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-23 15:35:17,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23583548] [2022-11-23 15:35:17,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23583548] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-23 15:35:17,088 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-23 15:35:17,088 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-23 15:35:17,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764773712] [2022-11-23 15:35:17,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-23 15:35:17,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-23 15:35:17,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-23 15:35:17,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-23 15:35:17,089 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-11-23 15:35:17,090 INFO L87 Difference]: Start difference. First operand 93 states and 199 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:17,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-23 15:35:17,559 INFO L93 Difference]: Finished difference Result 112 states and 234 transitions. [2022-11-23 15:35:17,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-23 15:35:17,560 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-11-23 15:35:17,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-23 15:35:17,561 INFO L225 Difference]: With dead ends: 112 [2022-11-23 15:35:17,561 INFO L226 Difference]: Without dead ends: 57 [2022-11-23 15:35:17,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-11-23 15:35:17,562 INFO L413 NwaCegarLoop]: 7 mSDtfsCounter, 29 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-23 15:35:17,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 46 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-23 15:35:17,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-11-23 15:35:17,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-11-23 15:35:17,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.7678571428571428) internal successors, (99), 56 states have internal predecessors, (99), 0 states have call successors, (0), 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 15:35:17,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 99 transitions. [2022-11-23 15:35:17,564 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 99 transitions. Word has length 27 [2022-11-23 15:35:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-23 15:35:17,565 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 99 transitions. [2022-11-23 15:35:17,565 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 8 states have internal predecessors, (27), 0 states have call successors, (0), 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 15:35:17,565 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 99 transitions. [2022-11-23 15:35:17,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-23 15:35:17,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-23 15:35:17,566 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, 1, 1, 1, 1, 1] [2022-11-23 15:35:17,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-23 15:35:17,566 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2022-11-23 15:35:17,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-23 15:35:17,566 INFO L85 PathProgramCache]: Analyzing trace with hash -784583304, now seen corresponding path program 5 times [2022-11-23 15:35:17,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-23 15:35:17,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044361275] [2022-11-23 15:35:17,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-23 15:35:17,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-23 15:35:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:35:17,650 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-23 15:35:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-23 15:35:17,761 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-23 15:35:17,761 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-23 15:35:17,763 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2022-11-23 15:35:17,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2022-11-23 15:35:17,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 7 remaining) [2022-11-23 15:35:17,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 7 remaining) [2022-11-23 15:35:17,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 7 remaining) [2022-11-23 15:35:17,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 7 remaining) [2022-11-23 15:35:17,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2022-11-23 15:35:17,767 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-23 15:35:17,770 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-23 15:35:17,776 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-11-23 15:35:17,776 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-23 15:35:17,925 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 03:35:17 BasicIcfg [2022-11-23 15:35:17,927 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-23 15:35:17,928 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-23 15:35:17,928 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-23 15:35:17,929 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-23 15:35:17,929 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:34:58" (3/4) ... [2022-11-23 15:35:17,931 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-23 15:35:18,071 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/bin/utaipan-Q6hlc19bkW/witness.graphml [2022-11-23 15:35:18,072 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-23 15:35:18,073 INFO L158 Benchmark]: Toolchain (without parser) took 21611.77ms. Allocated memory was 130.0MB in the beginning and 270.5MB in the end (delta: 140.5MB). Free memory was 89.1MB in the beginning and 92.1MB in the end (delta: -3.0MB). Peak memory consumption was 138.8MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,073 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 130.0MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-23 15:35:18,076 INFO L158 Benchmark]: CACSL2BoogieTranslator took 966.30ms. Allocated memory is still 130.0MB. Free memory was 88.9MB in the beginning and 64.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,077 INFO L158 Benchmark]: Boogie Procedure Inliner took 95.41ms. Allocated memory is still 130.0MB. Free memory was 64.7MB in the beginning and 61.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,078 INFO L158 Benchmark]: Boogie Preprocessor took 42.54ms. Allocated memory is still 130.0MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,078 INFO L158 Benchmark]: RCFGBuilder took 1297.38ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 59.8MB in the beginning and 113.9MB in the end (delta: -54.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,079 INFO L158 Benchmark]: TraceAbstraction took 19055.38ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 113.3MB in the beginning and 109.9MB in the end (delta: 3.4MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,079 INFO L158 Benchmark]: Witness Printer took 144.82ms. Allocated memory is still 270.5MB. Free memory was 109.9MB in the beginning and 92.1MB in the end (delta: 17.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-23 15:35:18,081 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.32ms. Allocated memory is still 130.0MB. Free memory is still 74.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 966.30ms. Allocated memory is still 130.0MB. Free memory was 88.9MB in the beginning and 64.7MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 95.41ms. Allocated memory is still 130.0MB. Free memory was 64.7MB in the beginning and 61.9MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.54ms. Allocated memory is still 130.0MB. Free memory was 61.9MB in the beginning and 59.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1297.38ms. Allocated memory was 130.0MB in the beginning and 178.3MB in the end (delta: 48.2MB). Free memory was 59.8MB in the beginning and 113.9MB in the end (delta: -54.1MB). Peak memory consumption was 7.8MB. Max. memory is 16.1GB. * TraceAbstraction took 19055.38ms. Allocated memory was 178.3MB in the beginning and 270.5MB in the end (delta: 92.3MB). Free memory was 113.3MB in the beginning and 109.9MB in the end (delta: 3.4MB). Peak memory consumption was 95.3MB. Max. memory is 16.1GB. * Witness Printer took 144.82ms. Allocated memory is still 270.5MB. Free memory was 109.9MB in the beginning and 92.1MB in the end (delta: 17.8MB). 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: 7.2s, 149 PlacesBefore, 46 PlacesAfterwards, 138 TransitionsBefore, 34 TransitionsAfterwards, 3060 CoEnabledTransitionPairs, 7 FixpointIterations, 48 TrivialSequentialCompositions, 58 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 11 ConcurrentYvCompositions, 1 ChoiceCompositions, 118 TotalNumberOfCompositions, 7493 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4506, independent: 4314, independent conditional: 0, independent unconditional: 4314, dependent: 192, dependent conditional: 0, dependent unconditional: 192, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2217, independent: 2154, independent conditional: 0, independent unconditional: 2154, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2217, independent: 2123, independent conditional: 0, independent unconditional: 2123, dependent: 94, dependent conditional: 0, dependent unconditional: 94, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 94, independent: 31, independent conditional: 0, independent unconditional: 31, dependent: 63, dependent conditional: 0, dependent unconditional: 63, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 643, independent: 72, independent conditional: 0, independent unconditional: 72, dependent: 571, dependent conditional: 0, dependent unconditional: 571, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4506, independent: 2160, independent conditional: 0, independent unconditional: 2160, dependent: 129, dependent conditional: 0, dependent unconditional: 129, unknown: 2217, unknown conditional: 0, unknown unconditional: 2217] , Statistics on independence cache: Total cache size (in pairs): 272, Positive cache size: 243, Positive conditional cache size: 0, Positive unconditional cache size: 243, Negative cache size: 29, Negative conditional cache size: 0, Negative unconditional cache size: 29, 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: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p2_EBX = 0; [L720] 0 int __unbuffered_p3_EAX = 0; [L722] 0 int __unbuffered_p3_EBX = 0; [L724] 0 int a = 0; [L725] 0 _Bool main$tmp_guard0; [L726] 0 _Bool main$tmp_guard1; [L728] 0 int x = 0; [L730] 0 int y = 0; [L732] 0 int z = 0; [L733] 0 _Bool z$flush_delayed; [L734] 0 int z$mem_tmp; [L735] 0 _Bool z$r_buff0_thd0; [L736] 0 _Bool z$r_buff0_thd1; [L737] 0 _Bool z$r_buff0_thd2; [L738] 0 _Bool z$r_buff0_thd3; [L739] 0 _Bool z$r_buff0_thd4; [L740] 0 _Bool z$r_buff1_thd0; [L741] 0 _Bool z$r_buff1_thd1; [L742] 0 _Bool z$r_buff1_thd2; [L743] 0 _Bool z$r_buff1_thd3; [L744] 0 _Bool z$r_buff1_thd4; [L745] 0 _Bool z$read_delayed; [L746] 0 int *z$read_delayed_var; [L747] 0 int z$w_buff0; [L748] 0 _Bool z$w_buff0_used; [L749] 0 int z$w_buff1; [L750] 0 _Bool z$w_buff1_used; [L751] 0 _Bool weak$$choice0; [L752] 0 _Bool weak$$choice2; [L871] 0 pthread_t t93; [L872] FCALL, FORK 0 pthread_create(&t93, ((void *)0), P0, ((void *)0)) VAL [#in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t93, ((void *)0), P0, ((void *)0))=-3, t93={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L873] 0 pthread_t t94; [L874] FCALL, FORK 0 pthread_create(&t94, ((void *)0), P1, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t94, ((void *)0), P1, ((void *)0))=-2, t93={5:0}, t94={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L875] 0 pthread_t t95; [L876] FCALL, FORK 0 pthread_create(&t95, ((void *)0), P2, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t95, ((void *)0), P2, ((void *)0))=-1, t93={5:0}, t94={6:0}, t95={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L877] 0 pthread_t t96; [L878] FCALL, FORK 0 pthread_create(&t96, ((void *)0), P3, ((void *)0)) VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t96, ((void *)0), P3, ((void *)0))=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L817] 4 z$w_buff1 = z$w_buff0 [L818] 4 z$w_buff0 = 1 [L819] 4 z$w_buff1_used = z$w_buff0_used [L820] 4 z$w_buff0_used = (_Bool)1 [L821] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L821] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L822] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L823] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L824] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L825] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L826] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = (_Bool)1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L830] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L831] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L832] 4 z$flush_delayed = weak$$choice2 [L833] 4 z$mem_tmp = z [L834] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L835] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L836] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L837] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L838] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L839] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L840] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L841] 4 __unbuffered_p3_EAX = z [L842] 4 z = z$flush_delayed ? z$mem_tmp : z [L843] 4 z$flush_delayed = (_Bool)0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L846] 4 __unbuffered_p3_EBX = a VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L756] 1 a = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L759] 1 __unbuffered_p0_EAX = x VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L766] 1 return 0; [L771] 2 x = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L774] 2 __unbuffered_p1_EAX = y VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L786] 3 y = 1 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L779] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L781] 2 return 0; [L789] 3 __unbuffered_p2_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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=255, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L792] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L793] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L794] 3 z$flush_delayed = weak$$choice2 [L795] 3 z$mem_tmp = z [L796] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L797] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L798] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L799] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L800] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L802] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L803] 3 __unbuffered_p2_EBX = z [L804] 3 z = z$flush_delayed ? z$mem_tmp : z [L805] 3 z$flush_delayed = (_Bool)0 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=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L810] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L812] 3 return 0; [L849] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L850] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L851] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L852] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L853] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L858] 4 return 0; [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L885] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L886] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L887] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L888] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [#in~arg={0:0}, #in~arg={0:0}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t93={5:0}, t94={6:0}, t95={7:0}, t96={3:0}, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L891] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L893] 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}, #in~arg={0:0}, \result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, unknown-#in~expression-unknown=0, unknown-#in~expression-unknown=1, weak$$choice0=49, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - 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: 874]: 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: 876]: 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: 872]: 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: 878]: 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 9 procedures, 173 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 18.7s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.1s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 7.5s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 680 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 680 mSDsluCounter, 230 SdHoareTripleChecker+Invalid, 1.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 158 mSDsCounter, 44 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1254 IncrementalHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 44 mSolverCounterUnsat, 72 mSDtfsCounter, 1254 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 69 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3162occurred in iteration=0, InterpolantAutomatonStates: 65, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.8s AutomataMinimizationTime, 12 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.1s InterpolantComputationTime, 263 NumberOfCodeBlocks, 263 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 224 ConstructedInterpolants, 0 QuantifiedInterpolants, 1887 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 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 15:35:18,109 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fcbc2a7e-470e-4598-a2ab-0fa8069bc156/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