./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix027_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix027_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4287f2874aaf131b089daa4f9099693806255408 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 22:13:02,532 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 22:13:02,534 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 22:13:02,569 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 22:13:02,569 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 22:13:02,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 22:13:02,574 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 22:13:02,578 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 22:13:02,580 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 22:13:02,589 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 22:13:02,590 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 22:13:02,591 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 22:13:02,591 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 22:13:02,593 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 22:13:02,594 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 22:13:02,598 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 22:13:02,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 22:13:02,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 22:13:02,600 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 22:13:02,601 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 22:13:02,601 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 22:13:02,605 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 22:13:02,606 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 22:13:02,607 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 22:13:02,613 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 22:13:02,613 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 22:13:02,613 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 22:13:02,614 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 22:13:02,614 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 22:13:02,615 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 22:13:02,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 22:13:02,615 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 22:13:02,616 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 22:13:02,616 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 22:13:02,617 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 22:13:02,617 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 22:13:02,618 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 22:13:02,618 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 22:13:02,618 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 22:13:02,618 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 22:13:02,619 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 22:13:02,622 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 22:13:02,650 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 22:13:02,650 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 22:13:02,651 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 22:13:02,651 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 22:13:02,652 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 22:13:02,652 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 22:13:02,652 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 22:13:02,652 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 22:13:02,652 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 22:13:02,652 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 22:13:02,653 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 22:13:02,653 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 22:13:02,653 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 22:13:02,653 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 22:13:02,653 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 22:13:02,653 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 22:13:02,654 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:13:02,654 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 22:13:02,654 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 22:13:02,655 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 22:13:02,655 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 22:13:02,655 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 22:13:02,655 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> Automizer 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 -> 4287f2874aaf131b089daa4f9099693806255408 [2021-08-29 22:13:02,906 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 22:13:02,932 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 22:13:02,934 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 22:13:02,935 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 22:13:02,936 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 22:13:02,936 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix027_tso.oepc.i [2021-08-29 22:13:02,979 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1bc67e5/1d05d6dbb064404fa6d621f36dc385c8/FLAG0bad1c333 [2021-08-29 22:13:03,388 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 22:13:03,388 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix027_tso.oepc.i [2021-08-29 22:13:03,399 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1bc67e5/1d05d6dbb064404fa6d621f36dc385c8/FLAG0bad1c333 [2021-08-29 22:13:03,775 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a1bc67e5/1d05d6dbb064404fa6d621f36dc385c8 [2021-08-29 22:13:03,776 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 22:13:03,777 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 22:13:03,778 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 22:13:03,778 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 22:13:03,795 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 22:13:03,795 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:03" (1/1) ... [2021-08-29 22:13:03,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38fbdbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:03, skipping insertion in model container [2021-08-29 22:13:03,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:03" (1/1) ... [2021-08-29 22:13:03,800 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 22:13:03,833 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 22:13:03,965 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix027_tso.oepc.i[949,962] [2021-08-29 22:13:04,181 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:13:04,189 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 22:13:04,197 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix027_tso.oepc.i[949,962] [2021-08-29 22:13:04,266 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:13:04,300 INFO L208 MainTranslator]: Completed translation [2021-08-29 22:13:04,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04 WrapperNode [2021-08-29 22:13:04,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 22:13:04,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 22:13:04,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 22:13:04,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 22:13:04,306 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,365 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 22:13:04,366 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 22:13:04,366 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 22:13:04,366 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 22:13:04,373 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,373 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,384 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,384 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,390 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,410 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,412 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 22:13:04,413 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 22:13:04,413 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 22:13:04,413 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 22:13:04,414 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (1/1) ... [2021-08-29 22:13:04,422 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:13:04,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 22:13:04,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 22:13:04,537 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 22:13:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 22:13:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-29 22:13:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 22:13:04,557 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 22:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-29 22:13:04,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-29 22:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-29 22:13:04,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-29 22:13:04,558 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-29 22:13:04,558 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-29 22:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-29 22:13:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-29 22:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 22:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-29 22:13:04,567 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 22:13:04,567 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 22:13:04,569 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-29 22:13:05,216 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 22:13:05,216 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-29 22:13:05,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:05 BoogieIcfgContainer [2021-08-29 22:13:05,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 22:13:05,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 22:13:05,219 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 22:13:05,221 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 22:13:05,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:13:03" (1/3) ... [2021-08-29 22:13:05,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158ae14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:05, skipping insertion in model container [2021-08-29 22:13:05,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:04" (2/3) ... [2021-08-29 22:13:05,222 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@158ae14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:05, skipping insertion in model container [2021-08-29 22:13:05,222 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:05" (3/3) ... [2021-08-29 22:13:05,222 INFO L111 eAbstractionObserver]: Analyzing ICFG mix027_tso.oepc.i [2021-08-29 22:13:05,226 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 22:13:05,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 22:13:05,226 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 22:13:05,226 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 22:13:05,276 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,277 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,278 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,279 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,280 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,281 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,281 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,282 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,283 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,284 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,285 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,287 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,288 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,289 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,290 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,290 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,292 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,292 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,292 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,293 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,293 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,293 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,297 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,298 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,299 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,306 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,306 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,307 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,308 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,309 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,309 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,310 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,310 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,311 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,312 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,312 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,315 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,316 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,316 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:05,317 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-29 22:13:05,349 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 22:13:05,355 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 22:13:05,355 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-29 22:13:05,363 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 22:13:05,371 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 140 places, 129 transitions, 278 flow [2021-08-29 22:13:05,373 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 140 places, 129 transitions, 278 flow [2021-08-29 22:13:05,374 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 140 places, 129 transitions, 278 flow [2021-08-29 22:13:05,411 INFO L129 PetriNetUnfolder]: 2/125 cut-off events. [2021-08-29 22:13:05,412 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-29 22:13:05,416 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 125 events. 2/125 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 71 event pairs, 0 based on Foata normal form. 0/121 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2021-08-29 22:13:05,419 INFO L116 LiptonReduction]: Number of co-enabled transitions 3090 [2021-08-29 22:13:11,606 INFO L131 LiptonReduction]: Checked pairs total: 8984 [2021-08-29 22:13:11,607 INFO L133 LiptonReduction]: Total number of compositions: 106 [2021-08-29 22:13:11,613 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 48 places, 36 transitions, 92 flow [2021-08-29 22:13:11,759 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 5172 states, 5169 states have (on average 4.176436448055717) internal successors, (21588), 5171 states have internal predecessors, (21588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 5172 states, 5169 states have (on average 4.176436448055717) internal successors, (21588), 5171 states have internal predecessors, (21588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:11,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-08-29 22:13:11,780 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:11,781 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-08-29 22:13:11,782 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P1Err0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:11,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:11,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1199130471, now seen corresponding path program 1 times [2021-08-29 22:13:11,792 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:11,792 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851937195] [2021-08-29 22:13:11,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:11,793 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:11,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:12,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:12,028 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:12,029 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851937195] [2021-08-29 22:13:12,029 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851937195] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:12,029 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:12,029 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:13:12,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577260549] [2021-08-29 22:13:12,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:13:12,034 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:12,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:13:12,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:12,075 INFO L87 Difference]: Start difference. First operand has 5172 states, 5169 states have (on average 4.176436448055717) internal successors, (21588), 5171 states have internal predecessors, (21588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:12,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:12,196 INFO L93 Difference]: Finished difference Result 4212 states and 16640 transitions. [2021-08-29 22:13:12,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:13:12,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-08-29 22:13:12,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:12,241 INFO L225 Difference]: With dead ends: 4212 [2021-08-29 22:13:12,241 INFO L226 Difference]: Without dead ends: 4062 [2021-08-29 22:13:12,242 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.93ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:12,245 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 17 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.13ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.58ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:12,245 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 1.13ms Time], IncrementalHoareTripleChecker [5 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 39.58ms Time] [2021-08-29 22:13:12,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4062 states. [2021-08-29 22:13:12,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4062 to 4062. [2021-08-29 22:13:12,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 4061 states have (on average 3.9706968726914553) internal successors, (16125), 4061 states have internal predecessors, (16125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:12,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 16125 transitions. [2021-08-29 22:13:12,465 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 16125 transitions. Word has length 5 [2021-08-29 22:13:12,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:12,466 INFO L470 AbstractCegarLoop]: Abstraction has 4062 states and 16125 transitions. [2021-08-29 22:13:12,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 16125 transitions. [2021-08-29 22:13:12,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 22:13:12,477 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:12,477 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:12,477 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 22:13:12,478 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:12,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:12,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1716925807, now seen corresponding path program 1 times [2021-08-29 22:13:12,479 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:12,481 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615367335] [2021-08-29 22:13:12,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:12,482 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:12,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:12,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:12,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:12,698 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615367335] [2021-08-29 22:13:12,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615367335] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:12,698 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:12,698 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:12,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800239436] [2021-08-29 22:13:12,699 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:12,699 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:12,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:12,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:12,700 INFO L87 Difference]: Start difference. First operand 4062 states and 16125 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2021-08-29 22:13:12,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:12,874 INFO L93 Difference]: Finished difference Result 4764 states and 18334 transitions. [2021-08-29 22:13:12,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:12,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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 [2021-08-29 22:13:12,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:12,897 INFO L225 Difference]: With dead ends: 4764 [2021-08-29 22:13:12,897 INFO L226 Difference]: Without dead ends: 4014 [2021-08-29 22:13:12,898 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.42ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:12,899 INFO L928 BasicCegarLoop]: 20 mSDtfsCounter, 44 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 97.75ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.23ms SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 109.20ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:12,899 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 51 Invalid, 75 Unknown, 0 Unchecked, 2.23ms Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 109.20ms Time] [2021-08-29 22:13:12,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4014 states. [2021-08-29 22:13:12,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4014 to 4014. [2021-08-29 22:13:12,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4014 states, 4013 states have (on average 3.9583852479441815) internal successors, (15885), 4013 states have internal predecessors, (15885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:13,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4014 states to 4014 states and 15885 transitions. [2021-08-29 22:13:13,055 INFO L78 Accepts]: Start accepts. Automaton has 4014 states and 15885 transitions. Word has length 12 [2021-08-29 22:13:13,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:13,056 INFO L470 AbstractCegarLoop]: Abstraction has 4014 states and 15885 transitions. [2021-08-29 22:13:13,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 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) [2021-08-29 22:13:13,056 INFO L276 IsEmpty]: Start isEmpty. Operand 4014 states and 15885 transitions. [2021-08-29 22:13:13,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:13:13,057 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:13,057 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:13,058 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 22:13:13,058 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:13,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:13,058 INFO L82 PathProgramCache]: Analyzing trace with hash -1685135774, now seen corresponding path program 1 times [2021-08-29 22:13:13,059 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:13,059 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468995965] [2021-08-29 22:13:13,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:13,059 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:13,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:13,113 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:13,114 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468995965] [2021-08-29 22:13:13,114 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468995965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:13,114 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:13,114 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:13,114 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835098537] [2021-08-29 22:13:13,114 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:13,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:13,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:13,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:13,115 INFO L87 Difference]: Start difference. First operand 4014 states and 15885 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:13,205 INFO L93 Difference]: Finished difference Result 4612 states and 17718 transitions. [2021-08-29 22:13:13,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:13,206 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 22:13:13,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:13,226 INFO L225 Difference]: With dead ends: 4612 [2021-08-29 22:13:13,226 INFO L226 Difference]: Without dead ends: 3922 [2021-08-29 22:13:13,226 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.08ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:13,227 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 37 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.85ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 54.46ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:13,227 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 52 Invalid, 63 Unknown, 0 Unchecked, 0.85ms Time], IncrementalHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 54.46ms Time] [2021-08-29 22:13:13,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3922 states. [2021-08-29 22:13:13,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3922 to 3922. [2021-08-29 22:13:13,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3922 states, 3921 states have (on average 3.9441469013006887) internal successors, (15465), 3921 states have internal predecessors, (15465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:13,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 15465 transitions. [2021-08-29 22:13:13,397 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 15465 transitions. Word has length 13 [2021-08-29 22:13:13,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:13,398 INFO L470 AbstractCegarLoop]: Abstraction has 3922 states and 15465 transitions. [2021-08-29 22:13:13,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:13,398 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 15465 transitions. [2021-08-29 22:13:13,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:13:13,401 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:13,401 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:13,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 22:13:13,401 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:13,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:13,402 INFO L82 PathProgramCache]: Analyzing trace with hash -1533882124, now seen corresponding path program 1 times [2021-08-29 22:13:13,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:13,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20887941] [2021-08-29 22:13:13,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:13,403 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:13,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:13,464 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:13,464 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20887941] [2021-08-29 22:13:13,464 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20887941] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:13,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:13,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:13,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833728983] [2021-08-29 22:13:13,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:13,465 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:13,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:13,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:13,466 INFO L87 Difference]: Start difference. First operand 3922 states and 15465 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) [2021-08-29 22:13:13,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:13,598 INFO L93 Difference]: Finished difference Result 4206 states and 16120 transitions. [2021-08-29 22:13:13,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:13,599 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 [2021-08-29 22:13:13,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:13,649 INFO L225 Difference]: With dead ends: 4206 [2021-08-29 22:13:13,649 INFO L226 Difference]: Without dead ends: 3538 [2021-08-29 22:13:13,650 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.46ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:13,653 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 81.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.10ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 90.50ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:13,654 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 51 Invalid, 60 Unknown, 0 Unchecked, 1.10ms Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 90.50ms Time] [2021-08-29 22:13:13,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3538 states. [2021-08-29 22:13:13,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3538 to 3538. [2021-08-29 22:13:13,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3538 states, 3537 states have (on average 3.9030251625671473) internal successors, (13805), 3537 states have internal predecessors, (13805), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:13,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3538 states to 3538 states and 13805 transitions. [2021-08-29 22:13:13,814 INFO L78 Accepts]: Start accepts. Automaton has 3538 states and 13805 transitions. Word has length 14 [2021-08-29 22:13:13,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:13,815 INFO L470 AbstractCegarLoop]: Abstraction has 3538 states and 13805 transitions. [2021-08-29 22:13:13,815 INFO L471 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) [2021-08-29 22:13:13,815 INFO L276 IsEmpty]: Start isEmpty. Operand 3538 states and 13805 transitions. [2021-08-29 22:13:13,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:13:13,827 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:13,827 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:13,827 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 22:13:13,827 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:13,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:13,828 INFO L82 PathProgramCache]: Analyzing trace with hash -195224287, now seen corresponding path program 1 times [2021-08-29 22:13:13,828 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:13,828 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950274045] [2021-08-29 22:13:13,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:13,828 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:13,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:14,013 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:14,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950274045] [2021-08-29 22:13:14,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950274045] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:14,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:14,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:14,014 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583697385] [2021-08-29 22:13:14,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:14,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:14,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:14,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:14,014 INFO L87 Difference]: Start difference. First operand 3538 states and 13805 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:14,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:14,160 INFO L93 Difference]: Finished difference Result 4192 states and 16010 transitions. [2021-08-29 22:13:14,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:14,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 22:13:14,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:14,173 INFO L225 Difference]: With dead ends: 4192 [2021-08-29 22:13:14,173 INFO L226 Difference]: Without dead ends: 3666 [2021-08-29 22:13:14,173 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 40.71ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:14,175 INFO L928 BasicCegarLoop]: 21 mSDtfsCounter, 71 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 77.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 2.43ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 91.67ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:14,176 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 69 Invalid, 113 Unknown, 0 Unchecked, 2.43ms Time], IncrementalHoareTripleChecker [15 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 91.67ms Time] [2021-08-29 22:13:14,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3666 states. [2021-08-29 22:13:14,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3666 to 3666. [2021-08-29 22:13:14,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 3665 states have (on average 3.8889495225102317) internal successors, (14253), 3665 states have internal predecessors, (14253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:14,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 14253 transitions. [2021-08-29 22:13:14,360 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 14253 transitions. Word has length 15 [2021-08-29 22:13:14,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:14,360 INFO L470 AbstractCegarLoop]: Abstraction has 3666 states and 14253 transitions. [2021-08-29 22:13:14,360 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:14,361 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 14253 transitions. [2021-08-29 22:13:14,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:13:14,364 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:14,364 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:14,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 22:13:14,367 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:14,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:14,368 INFO L82 PathProgramCache]: Analyzing trace with hash -843329819, now seen corresponding path program 1 times [2021-08-29 22:13:14,369 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:14,369 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738598098] [2021-08-29 22:13:14,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:14,369 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:14,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:14,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:14,463 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:14,463 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738598098] [2021-08-29 22:13:14,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738598098] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:14,464 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:14,464 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:14,464 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138518977] [2021-08-29 22:13:14,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:14,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:14,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:14,465 INFO L87 Difference]: Start difference. First operand 3666 states and 14253 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:14,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:14,729 INFO L93 Difference]: Finished difference Result 4026 states and 15398 transitions. [2021-08-29 22:13:14,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:14,730 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-29 22:13:14,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:14,753 INFO L225 Difference]: With dead ends: 4026 [2021-08-29 22:13:14,753 INFO L226 Difference]: Without dead ends: 3712 [2021-08-29 22:13:14,753 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 36.28ms TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:14,769 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 51 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 146.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.07ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 200.41ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:14,769 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 96 Invalid, 149 Unknown, 0 Unchecked, 1.07ms Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 200.41ms Time] [2021-08-29 22:13:14,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3712 states. [2021-08-29 22:13:14,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3712 to 3712. [2021-08-29 22:13:14,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3712 states, 3711 states have (on average 3.887361897062786) internal successors, (14426), 3711 states have internal predecessors, (14426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:14,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3712 states to 3712 states and 14426 transitions. [2021-08-29 22:13:14,939 INFO L78 Accepts]: Start accepts. Automaton has 3712 states and 14426 transitions. Word has length 16 [2021-08-29 22:13:14,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:14,939 INFO L470 AbstractCegarLoop]: Abstraction has 3712 states and 14426 transitions. [2021-08-29 22:13:14,940 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:14,940 INFO L276 IsEmpty]: Start isEmpty. Operand 3712 states and 14426 transitions. [2021-08-29 22:13:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:14,944 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:14,944 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:14,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 22:13:14,944 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:14,944 INFO L82 PathProgramCache]: Analyzing trace with hash 2021580951, now seen corresponding path program 1 times [2021-08-29 22:13:14,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:14,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672107903] [2021-08-29 22:13:14,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:14,945 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:14,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:15,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:15,077 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:15,077 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672107903] [2021-08-29 22:13:15,077 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672107903] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:15,077 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:15,077 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:15,078 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047483022] [2021-08-29 22:13:15,078 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:15,078 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:15,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:15,079 INFO L87 Difference]: Start difference. First operand 3712 states and 14426 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:15,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:15,284 INFO L93 Difference]: Finished difference Result 4832 states and 18520 transitions. [2021-08-29 22:13:15,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 22:13:15,285 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:15,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:15,298 INFO L225 Difference]: With dead ends: 4832 [2021-08-29 22:13:15,298 INFO L226 Difference]: Without dead ends: 4416 [2021-08-29 22:13:15,298 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 56.91ms TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:13:15,299 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 75 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 123.82ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 146.48ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:15,299 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 125 Invalid, 194 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [22 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 146.48ms Time] [2021-08-29 22:13:15,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4416 states. [2021-08-29 22:13:15,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4416 to 4416. [2021-08-29 22:13:15,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4416 states, 4415 states have (on average 3.8749716874292184) internal successors, (17108), 4415 states have internal predecessors, (17108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4416 states to 4416 states and 17108 transitions. [2021-08-29 22:13:15,462 INFO L78 Accepts]: Start accepts. Automaton has 4416 states and 17108 transitions. Word has length 17 [2021-08-29 22:13:15,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:15,463 INFO L470 AbstractCegarLoop]: Abstraction has 4416 states and 17108 transitions. [2021-08-29 22:13:15,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:15,463 INFO L276 IsEmpty]: Start isEmpty. Operand 4416 states and 17108 transitions. [2021-08-29 22:13:15,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:15,470 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:15,470 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:15,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 22:13:15,470 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:15,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:15,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1898873542, now seen corresponding path program 1 times [2021-08-29 22:13:15,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:15,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803272252] [2021-08-29 22:13:15,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:15,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:15,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:15,594 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:15,594 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803272252] [2021-08-29 22:13:15,594 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803272252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:15,594 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:15,594 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:15,594 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158787358] [2021-08-29 22:13:15,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:15,595 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:15,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:15,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:15,596 INFO L87 Difference]: Start difference. First operand 4416 states and 17108 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:15,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:15,807 INFO L93 Difference]: Finished difference Result 5402 states and 20585 transitions. [2021-08-29 22:13:15,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-29 22:13:15,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:15,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:15,822 INFO L225 Difference]: With dead ends: 5402 [2021-08-29 22:13:15,822 INFO L226 Difference]: Without dead ends: 4996 [2021-08-29 22:13:15,822 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 65.48ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:13:15,824 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 91 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 121.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.90ms SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 140.78ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:15,824 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [91 Valid, 96 Invalid, 164 Unknown, 0 Unchecked, 0.90ms Time], IncrementalHoareTripleChecker [33 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 140.78ms Time] [2021-08-29 22:13:15,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4996 states. [2021-08-29 22:13:15,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4996 to 4250. [2021-08-29 22:13:15,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4250 states, 4249 states have (on average 3.85337726523888) internal successors, (16373), 4249 states have internal predecessors, (16373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:15,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4250 states to 4250 states and 16373 transitions. [2021-08-29 22:13:15,933 INFO L78 Accepts]: Start accepts. Automaton has 4250 states and 16373 transitions. Word has length 17 [2021-08-29 22:13:15,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:15,934 INFO L470 AbstractCegarLoop]: Abstraction has 4250 states and 16373 transitions. [2021-08-29 22:13:15,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:15,934 INFO L276 IsEmpty]: Start isEmpty. Operand 4250 states and 16373 transitions. [2021-08-29 22:13:15,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:15,939 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:15,940 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:15,940 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 22:13:15,940 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:15,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:15,941 INFO L82 PathProgramCache]: Analyzing trace with hash 526523576, now seen corresponding path program 1 times [2021-08-29 22:13:15,941 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:15,941 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813233325] [2021-08-29 22:13:15,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:15,941 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:16,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:16,128 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:16,128 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813233325] [2021-08-29 22:13:16,128 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813233325] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:16,128 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:16,128 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:16,128 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821690120] [2021-08-29 22:13:16,129 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:16,129 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:16,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:16,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:16,129 INFO L87 Difference]: Start difference. First operand 4250 states and 16373 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:16,287 INFO L93 Difference]: Finished difference Result 4402 states and 16751 transitions. [2021-08-29 22:13:16,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:16,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:16,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:16,298 INFO L225 Difference]: With dead ends: 4402 [2021-08-29 22:13:16,298 INFO L226 Difference]: Without dead ends: 4202 [2021-08-29 22:13:16,298 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 58.66ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:13:16,300 INFO L928 BasicCegarLoop]: 19 mSDtfsCounter, 98 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 71.15ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 106.16ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:16,300 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 85 Invalid, 121 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [19 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 106.16ms Time] [2021-08-29 22:13:16,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4202 states. [2021-08-29 22:13:16,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4202 to 4130. [2021-08-29 22:13:16,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4130 states, 4129 states have (on average 3.8403971906030514) internal successors, (15857), 4129 states have internal predecessors, (15857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4130 states to 4130 states and 15857 transitions. [2021-08-29 22:13:16,373 INFO L78 Accepts]: Start accepts. Automaton has 4130 states and 15857 transitions. Word has length 17 [2021-08-29 22:13:16,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:16,373 INFO L470 AbstractCegarLoop]: Abstraction has 4130 states and 15857 transitions. [2021-08-29 22:13:16,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4130 states and 15857 transitions. [2021-08-29 22:13:16,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:16,378 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:16,378 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:16,378 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 22:13:16,378 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:16,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:16,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1364975682, now seen corresponding path program 1 times [2021-08-29 22:13:16,379 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:16,379 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063997762] [2021-08-29 22:13:16,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:16,379 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:16,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:16,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:16,429 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:16,429 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063997762] [2021-08-29 22:13:16,429 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063997762] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:16,429 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:16,429 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:16,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25107865] [2021-08-29 22:13:16,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:13:16,430 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:16,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:13:16,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:16,430 INFO L87 Difference]: Start difference. First operand 4130 states and 15857 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:16,477 INFO L93 Difference]: Finished difference Result 3106 states and 10737 transitions. [2021-08-29 22:13:16,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:13:16,478 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:16,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:16,486 INFO L225 Difference]: With dead ends: 3106 [2021-08-29 22:13:16,486 INFO L226 Difference]: Without dead ends: 3106 [2021-08-29 22:13:16,487 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.17ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:16,487 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 12 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 29.67ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.09ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.23ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:16,488 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 20 Invalid, 36 Unknown, 0 Unchecked, 0.09ms Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 34.23ms Time] [2021-08-29 22:13:16,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3106 states. [2021-08-29 22:13:16,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3106 to 3106. [2021-08-29 22:13:16,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3106 states, 3105 states have (on average 3.457971014492754) internal successors, (10737), 3105 states have internal predecessors, (10737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3106 states to 3106 states and 10737 transitions. [2021-08-29 22:13:16,533 INFO L78 Accepts]: Start accepts. Automaton has 3106 states and 10737 transitions. Word has length 17 [2021-08-29 22:13:16,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:16,533 INFO L470 AbstractCegarLoop]: Abstraction has 3106 states and 10737 transitions. [2021-08-29 22:13:16,533 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,534 INFO L276 IsEmpty]: Start isEmpty. Operand 3106 states and 10737 transitions. [2021-08-29 22:13:16,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:16,537 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:16,537 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:16,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 22:13:16,538 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:16,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:16,538 INFO L82 PathProgramCache]: Analyzing trace with hash -742631703, now seen corresponding path program 1 times [2021-08-29 22:13:16,538 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:16,538 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738215751] [2021-08-29 22:13:16,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:16,538 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:16,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:16,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:16,585 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:16,585 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738215751] [2021-08-29 22:13:16,585 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738215751] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:16,585 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:16,585 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:16,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547926420] [2021-08-29 22:13:16,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:16,586 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:16,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:16,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:16,586 INFO L87 Difference]: Start difference. First operand 3106 states and 10737 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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) [2021-08-29 22:13:16,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:16,678 INFO L93 Difference]: Finished difference Result 1928 states and 6025 transitions. [2021-08-29 22:13:16,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:13:16,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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 [2021-08-29 22:13:16,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:16,682 INFO L225 Difference]: With dead ends: 1928 [2021-08-29 22:13:16,683 INFO L226 Difference]: Without dead ends: 1928 [2021-08-29 22:13:16,683 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.09ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:16,683 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.25ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.21ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 82.33ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:16,683 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 28 Invalid, 57 Unknown, 0 Unchecked, 0.21ms Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 82.33ms Time] [2021-08-29 22:13:16,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1928 states. [2021-08-29 22:13:16,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1928 to 1724. [2021-08-29 22:13:16,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1724 states, 1723 states have (on average 3.089378990133488) internal successors, (5323), 1723 states have internal predecessors, (5323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 5323 transitions. [2021-08-29 22:13:16,709 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 5323 transitions. Word has length 18 [2021-08-29 22:13:16,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:16,710 INFO L470 AbstractCegarLoop]: Abstraction has 1724 states and 5323 transitions. [2021-08-29 22:13:16,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 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) [2021-08-29 22:13:16,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 5323 transitions. [2021-08-29 22:13:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-29 22:13:16,713 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:16,713 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:16,713 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 22:13:16,713 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash 799793701, now seen corresponding path program 1 times [2021-08-29 22:13:16,714 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:16,714 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014787016] [2021-08-29 22:13:16,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:16,714 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:16,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:16,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:16,762 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:16,762 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014787016] [2021-08-29 22:13:16,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014787016] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:16,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:16,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:16,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862819786] [2021-08-29 22:13:16,763 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:16,763 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:16,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:16,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:16,764 INFO L87 Difference]: Start difference. First operand 1724 states and 5323 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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) [2021-08-29 22:13:16,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:16,834 INFO L93 Difference]: Finished difference Result 1290 states and 4021 transitions. [2021-08-29 22:13:16,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:16,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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 [2021-08-29 22:13:16,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:16,838 INFO L225 Difference]: With dead ends: 1290 [2021-08-29 22:13:16,838 INFO L226 Difference]: Without dead ends: 1290 [2021-08-29 22:13:16,839 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.45ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:16,839 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 83 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.04ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.60ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:16,839 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 33 Invalid, 78 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [11 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 63.60ms Time] [2021-08-29 22:13:16,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states. [2021-08-29 22:13:16,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1158. [2021-08-29 22:13:16,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 3.133102852203976) internal successors, (3625), 1157 states have internal predecessors, (3625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:16,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 3625 transitions. [2021-08-29 22:13:16,858 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 3625 transitions. Word has length 21 [2021-08-29 22:13:16,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:16,858 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 3625 transitions. [2021-08-29 22:13:16,858 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 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) [2021-08-29 22:13:16,858 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 3625 transitions. [2021-08-29 22:13:16,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:16,860 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:16,861 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:16,861 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 22:13:16,861 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:16,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:16,861 INFO L82 PathProgramCache]: Analyzing trace with hash 98292084, now seen corresponding path program 1 times [2021-08-29 22:13:16,861 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:16,862 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379950257] [2021-08-29 22:13:16,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:16,862 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:16,924 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:16,924 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:16,924 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379950257] [2021-08-29 22:13:16,924 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379950257] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:16,925 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:16,925 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:16,925 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63984768] [2021-08-29 22:13:16,925 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:16,925 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:16,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:16,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:16,926 INFO L87 Difference]: Start difference. First operand 1158 states and 3625 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:17,014 INFO L93 Difference]: Finished difference Result 1535 states and 4688 transitions. [2021-08-29 22:13:17,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:17,014 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:17,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:17,017 INFO L225 Difference]: With dead ends: 1535 [2021-08-29 22:13:17,017 INFO L226 Difference]: Without dead ends: 1164 [2021-08-29 22:13:17,017 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 15.32ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:17,018 INFO L928 BasicCegarLoop]: 36 mSDtfsCounter, 40 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 60.47ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 72.64ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:17,018 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 99 Invalid, 114 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 72.64ms Time] [2021-08-29 22:13:17,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1164 states. [2021-08-29 22:13:17,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1164 to 1158. [2021-08-29 22:13:17,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1158 states, 1157 states have (on average 3.044943820224719) internal successors, (3523), 1157 states have internal predecessors, (3523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1158 states to 1158 states and 3523 transitions. [2021-08-29 22:13:17,032 INFO L78 Accepts]: Start accepts. Automaton has 1158 states and 3523 transitions. Word has length 25 [2021-08-29 22:13:17,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:17,032 INFO L470 AbstractCegarLoop]: Abstraction has 1158 states and 3523 transitions. [2021-08-29 22:13:17,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,033 INFO L276 IsEmpty]: Start isEmpty. Operand 1158 states and 3523 transitions. [2021-08-29 22:13:17,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:17,035 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:17,035 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:17,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 22:13:17,035 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:17,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:17,036 INFO L82 PathProgramCache]: Analyzing trace with hash 83265776, now seen corresponding path program 1 times [2021-08-29 22:13:17,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:17,036 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091076607] [2021-08-29 22:13:17,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:17,036 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:17,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:17,091 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091076607] [2021-08-29 22:13:17,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091076607] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:17,091 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:17,091 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:17,091 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89703983] [2021-08-29 22:13:17,091 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:17,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:17,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:17,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:17,092 INFO L87 Difference]: Start difference. First operand 1158 states and 3523 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:17,179 INFO L93 Difference]: Finished difference Result 1697 states and 5071 transitions. [2021-08-29 22:13:17,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:17,180 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:17,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:17,182 INFO L225 Difference]: With dead ends: 1697 [2021-08-29 22:13:17,182 INFO L226 Difference]: Without dead ends: 974 [2021-08-29 22:13:17,182 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.16ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:17,182 INFO L928 BasicCegarLoop]: 34 mSDtfsCounter, 44 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.45ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.47ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:17,182 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 93 Invalid, 110 Unknown, 0 Unchecked, 0.45ms Time], IncrementalHoareTripleChecker [0 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 70.47ms Time] [2021-08-29 22:13:17,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2021-08-29 22:13:17,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 968. [2021-08-29 22:13:17,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 967 states have (on average 2.842812823164426) internal successors, (2749), 967 states have internal predecessors, (2749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 2749 transitions. [2021-08-29 22:13:17,194 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 2749 transitions. Word has length 25 [2021-08-29 22:13:17,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:17,194 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 2749 transitions. [2021-08-29 22:13:17,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,195 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 2749 transitions. [2021-08-29 22:13:17,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:17,196 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:17,197 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:17,197 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 22:13:17,197 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:17,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:17,197 INFO L82 PathProgramCache]: Analyzing trace with hash 572618484, now seen corresponding path program 2 times [2021-08-29 22:13:17,197 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:17,197 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868678661] [2021-08-29 22:13:17,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:17,198 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:17,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:17,247 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:17,247 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868678661] [2021-08-29 22:13:17,247 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868678661] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:17,247 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:17,247 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:17,247 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549827804] [2021-08-29 22:13:17,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:17,248 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:17,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:17,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:17,248 INFO L87 Difference]: Start difference. First operand 968 states and 2749 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:17,318 INFO L93 Difference]: Finished difference Result 906 states and 2629 transitions. [2021-08-29 22:13:17,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:17,320 INFO L225 Difference]: With dead ends: 906 [2021-08-29 22:13:17,320 INFO L226 Difference]: Without dead ends: 366 [2021-08-29 22:13:17,320 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.93ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:17,321 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 149 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 52.98ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.44ms SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 64.78ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:17,321 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 30 Invalid, 88 Unknown, 0 Unchecked, 0.44ms Time], IncrementalHoareTripleChecker [21 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 64.78ms Time] [2021-08-29 22:13:17,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2021-08-29 22:13:17,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 358. [2021-08-29 22:13:17,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.7030812324929974) internal successors, (965), 357 states have internal predecessors, (965), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 965 transitions. [2021-08-29 22:13:17,326 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 965 transitions. Word has length 25 [2021-08-29 22:13:17,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:17,326 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 965 transitions. [2021-08-29 22:13:17,326 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 965 transitions. [2021-08-29 22:13:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:13:17,327 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:17,327 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:17,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 22:13:17,328 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1049724745, now seen corresponding path program 1 times [2021-08-29 22:13:17,328 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:17,328 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61154245] [2021-08-29 22:13:17,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:17,329 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:17,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:17,379 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:17,379 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61154245] [2021-08-29 22:13:17,379 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61154245] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:17,379 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:17,380 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:17,380 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687644265] [2021-08-29 22:13:17,380 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:17,380 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:17,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:17,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:17,381 INFO L87 Difference]: Start difference. First operand 358 states and 965 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:17,430 INFO L93 Difference]: Finished difference Result 514 states and 1388 transitions. [2021-08-29 22:13:17,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:13:17,430 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2021-08-29 22:13:17,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:17,431 INFO L225 Difference]: With dead ends: 514 [2021-08-29 22:13:17,431 INFO L226 Difference]: Without dead ends: 222 [2021-08-29 22:13:17,431 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.36ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:17,432 INFO L928 BasicCegarLoop]: 20 mSDtfsCounter, 11 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.62ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.23ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.62ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:17,432 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 51 Invalid, 62 Unknown, 0 Unchecked, 0.23ms Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 41.62ms Time] [2021-08-29 22:13:17,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-08-29 22:13:17,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2021-08-29 22:13:17,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 221 states have (on average 2.5384615384615383) internal successors, (561), 221 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 561 transitions. [2021-08-29 22:13:17,435 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 561 transitions. Word has length 29 [2021-08-29 22:13:17,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:17,435 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 561 transitions. [2021-08-29 22:13:17,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:17,435 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 561 transitions. [2021-08-29 22:13:17,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-08-29 22:13:17,436 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:17,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:17,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 22:13:17,436 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:17,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:17,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1781372919, now seen corresponding path program 2 times [2021-08-29 22:13:17,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:17,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419506598] [2021-08-29 22:13:17,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:17,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:17,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:13:17,463 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 22:13:17,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:13:17,520 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 22:13:17,521 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 22:13:17,521 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-08-29 22:13:17,522 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-08-29 22:13:17,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-08-29 22:13:17,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-08-29 22:13:17,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-08-29 22:13:17,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-08-29 22:13:17,523 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-08-29 22:13:17,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 22:13:17,527 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 22:13:17,527 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 22:13:17,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:13:17 BasicIcfg [2021-08-29 22:13:17,582 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 22:13:17,582 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 22:13:17,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 22:13:17,582 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 22:13:17,583 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:05" (3/4) ... [2021-08-29 22:13:17,584 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 22:13:17,635 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 22:13:17,635 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 22:13:17,635 INFO L158 Benchmark]: Toolchain (without parser) took 13858.32ms. Allocated memory was 56.6MB in the beginning and 616.6MB in the end (delta: 559.9MB). Free memory was 33.0MB in the beginning and 260.4MB in the end (delta: -227.4MB). Peak memory consumption was 330.7MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,635 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 22:13:17,636 INFO L158 Benchmark]: CACSL2BoogieTranslator took 523.09ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 32.8MB in the beginning and 40.6MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,636 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.05ms. Allocated memory is still 71.3MB. Free memory was 40.6MB in the beginning and 37.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,636 INFO L158 Benchmark]: Boogie Preprocessor took 46.26ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 35.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,636 INFO L158 Benchmark]: RCFGBuilder took 805.11ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 28.1MB in the end (delta: 7.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,637 INFO L158 Benchmark]: TraceAbstraction took 12362.82ms. Allocated memory was 71.3MB in the beginning and 616.6MB in the end (delta: 545.3MB). Free memory was 27.7MB in the beginning and 284.5MB in the end (delta: -256.8MB). Peak memory consumption was 289.0MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,637 INFO L158 Benchmark]: Witness Printer took 52.72ms. Allocated memory is still 616.6MB. Free memory was 284.5MB in the beginning and 260.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2021-08-29 22:13:17,638 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.10ms. Allocated memory is still 56.6MB. Free memory was 37.9MB in the beginning and 37.8MB in the end (delta: 50.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 523.09ms. Allocated memory was 56.6MB in the beginning and 71.3MB in the end (delta: 14.7MB). Free memory was 32.8MB in the beginning and 40.6MB in the end (delta: -7.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.05ms. Allocated memory is still 71.3MB. Free memory was 40.6MB in the beginning and 37.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.26ms. Allocated memory is still 71.3MB. Free memory was 37.7MB in the beginning and 35.1MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 805.11ms. Allocated memory is still 71.3MB. Free memory was 35.1MB in the beginning and 28.1MB in the end (delta: 7.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12362.82ms. Allocated memory was 71.3MB in the beginning and 616.6MB in the end (delta: 545.3MB). Free memory was 27.7MB in the beginning and 284.5MB in the end (delta: -256.8MB). Peak memory consumption was 289.0MB. Max. memory is 16.1GB. * Witness Printer took 52.72ms. Allocated memory is still 616.6MB. Free memory was 284.5MB in the beginning and 260.4MB in the end (delta: 24.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6234.08ms, 140 PlacesBefore, 48 PlacesAfterwards, 129 TransitionsBefore, 36 TransitionsAfterwards, 3090 CoEnabledTransitionPairs, 7 FixpointIterations, 42 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 106 TotalNumberOfCompositions, 8984 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4134, positive: 3905, positive conditional: 0, positive unconditional: 3905, negative: 229, negative conditional: 0, negative unconditional: 229, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2165, positive: 2105, positive conditional: 0, positive unconditional: 2105, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2165, positive: 2073, positive conditional: 0, positive unconditional: 2073, negative: 92, negative conditional: 0, negative unconditional: 92, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 92, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 341, positive: 41, positive conditional: 0, positive unconditional: 41, negative: 299, negative conditional: 0, negative unconditional: 299, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4134, positive: 1800, positive conditional: 0, positive unconditional: 1800, negative: 169, negative conditional: 0, negative unconditional: 169, unknown: 2165, unknown conditional: 0, unknown unconditional: 2165] , Statistics on independence cache: Total cache size (in pairs): 243, Positive cache size: 209, Positive conditional cache size: 0, Positive unconditional cache size: 209, Negative cache size: 34, Negative conditional cache size: 0, Negative unconditional cache size: 34 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms 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_p1_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L719] 0 _Bool main$tmp_guard0; [L720] 0 _Bool main$tmp_guard1; [L722] 0 int x = 0; [L723] 0 _Bool x$flush_delayed; [L724] 0 int x$mem_tmp; [L725] 0 _Bool x$r_buff0_thd0; [L726] 0 _Bool x$r_buff0_thd1; [L727] 0 _Bool x$r_buff0_thd2; [L728] 0 _Bool x$r_buff0_thd3; [L729] 0 _Bool x$r_buff0_thd4; [L730] 0 _Bool x$r_buff1_thd0; [L731] 0 _Bool x$r_buff1_thd1; [L732] 0 _Bool x$r_buff1_thd2; [L733] 0 _Bool x$r_buff1_thd3; [L734] 0 _Bool x$r_buff1_thd4; [L735] 0 _Bool x$read_delayed; [L736] 0 int *x$read_delayed_var; [L737] 0 int x$w_buff0; [L738] 0 _Bool x$w_buff0_used; [L739] 0 int x$w_buff1; [L740] 0 _Bool x$w_buff1_used; [L742] 0 int y = 0; [L744] 0 int z = 0; [L745] 0 _Bool weak$$choice0; [L746] 0 _Bool weak$$choice2; [L851] 0 pthread_t t737; [L852] FCALL, FORK 0 pthread_create(&t737, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L853] 0 pthread_t t738; [L854] FCALL, FORK 0 pthread_create(&t738, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L855] 0 pthread_t t739; [L856] FCALL, FORK 0 pthread_create(&t739, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L857] 0 pthread_t t740; [L858] FCALL, FORK 0 pthread_create(&t740, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L770] 2 x$w_buff1 = x$w_buff0 [L771] 2 x$w_buff0 = 2 [L772] 2 x$w_buff1_used = x$w_buff0_used [L773] 2 x$w_buff0_used = (_Bool)1 [L18] COND FALSE 2 !(!expression) [L775] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L776] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L777] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L778] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L779] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L780] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L783] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L800] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L803] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L820] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] EXPR 3 x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x [L806] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L806] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L807] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L807] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L808] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L808] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L809] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L809] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L810] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L810] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L813] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L815] 3 return 0; [L823] 4 __unbuffered_p3_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L826] 4 __unbuffered_p3_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L750] 1 a = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L753] 1 x = 1 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] EXPR 1 x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x [L756] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L756] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L757] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L757] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L758] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L758] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L759] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L759] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L760] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L760] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L763] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L765] 1 return 0; [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] EXPR 4 x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x [L829] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L829] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L830] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L830] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L831] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L831] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L832] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L832] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L833] EXPR 4 x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L833] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 [L786] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L786] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L787] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L787] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L788] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L788] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L789] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L789] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L790] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L790] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L793] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L795] 2 return 0; [L836] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L838] 4 return 0; [L860] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] EXPR 0 x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x [L864] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L864] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L865] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L865] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L866] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L866] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L867] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L867] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L868] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L868] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L871] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L872] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L873] 0 x$flush_delayed = weak$$choice2 [L874] 0 x$mem_tmp = x [L875] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L875] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L876] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L876] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L877] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L877] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L878] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L878] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L879] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L879] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L880] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L880] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L881] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L881] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L882] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L883] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L883] 0 x = x$flush_delayed ? x$mem_tmp : x [L884] 0 x$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=1, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 854]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 166 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 12177.73ms, OverallIterations: 17, TraceHistogramMax: 1, EmptinessCheckTime: 83.68ms, AutomataDifference: 2347.36ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 6404.11ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 903 SdHoareTripleChecker+Valid, 1408.90ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 903 mSDsluCounter, 1003 SdHoareTripleChecker+Invalid, 1144.94ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1235 mSDsCounter, 154 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1366 IncrementalHoareTripleChecker+Invalid, 1520 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 154 mSolverCounterUnsat, 339 mSDtfsCounter, 1366 mSolverCounterSat, 13.56ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 78 GetRequests, 7 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 365.43ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=5172occurred in iteration=0, InterpolantAutomatonStates: 88, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1513.86ms AutomataMinimizationTime, 16 MinimizatonAttempts, 1174 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 54.37ms SsaConstructionTime, 521.79ms SatisfiabilityAnalysisTime, 945.43ms InterpolantComputationTime, 315 NumberOfCodeBlocks, 315 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 270 ConstructedInterpolants, 0 QuantifiedInterpolants, 1729 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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! [2021-08-29 22:13:17,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...