./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix028_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 997cd7c3 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/mix028_pso.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 27bc528454fa5cfe09e68db7721d6c42f1084e50 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-dev-997cd7c-m [2021-09-22 14:41:35,457 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:41:35,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:41:35,490 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:41:35,490 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:41:35,493 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:41:35,494 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:41:35,497 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:41:35,499 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:41:35,502 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:41:35,503 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:41:35,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:41:35,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:41:35,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:41:35,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:41:35,519 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:41:35,519 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:41:35,520 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:41:35,521 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:41:35,526 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:41:35,526 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:41:35,527 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:41:35,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:41:35,529 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:41:35,534 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:41:35,534 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:41:35,534 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:41:35,535 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:41:35,536 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:41:35,536 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:41:35,537 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:41:35,537 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:41:35,538 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:41:35,539 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:41:35,540 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:41:35,540 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:41:35,541 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:41:35,541 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:41:35,541 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:41:35,542 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:41:35,543 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:41:35,546 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:41:35,574 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:41:35,575 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:41:35,576 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:41:35,576 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:41:35,577 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:41:35,578 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:41:35,578 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:41:35,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:41:35,578 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:41:35,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:41:35,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:41:35,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:41:35,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:41:35,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:41:35,580 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:41:35,580 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:41:35,580 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:41:35,580 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:41:35,580 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:41:35,580 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:41:35,580 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:41:35,581 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:41:35,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:41:35,581 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:41:35,581 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:41:35,581 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:41:35,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:41:35,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:41:35,582 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:41:35,582 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:41:35,582 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 -> 27bc528454fa5cfe09e68db7721d6c42f1084e50 [2021-09-22 14:41:35,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:41:35,926 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:41:35,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:41:35,929 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:41:35,945 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:41:35,946 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix028_pso.oepc.i [2021-09-22 14:41:36,058 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac255e29d/12a26112a96b4bb586f8075d3948dd9b/FLAG3e47ebf64 [2021-09-22 14:41:36,676 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:41:36,676 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix028_pso.oepc.i [2021-09-22 14:41:36,691 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac255e29d/12a26112a96b4bb586f8075d3948dd9b/FLAG3e47ebf64 [2021-09-22 14:41:37,020 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac255e29d/12a26112a96b4bb586f8075d3948dd9b [2021-09-22 14:41:37,021 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:41:37,023 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:41:37,025 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:41:37,025 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:41:37,028 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:41:37,028 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,029 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@212a73e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37, skipping insertion in model container [2021-09-22 14:41:37,029 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,034 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:41:37,079 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:41:37,317 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/mix028_pso.oepc.i[949,962] [2021-09-22 14:41:37,448 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:41:37,454 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:41:37,467 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/mix028_pso.oepc.i[949,962] [2021-09-22 14:41:37,528 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:41:37,563 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:41:37,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37 WrapperNode [2021-09-22 14:41:37,565 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:41:37,566 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:41:37,566 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:41:37,566 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:41:37,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,597 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:41:37,628 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:41:37,628 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:41:37,628 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:41:37,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,646 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,654 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:41:37,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:41:37,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:41:37,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:41:37,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (1/1) ... [2021-09-22 14:41:37,685 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:41:37,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:41:37,703 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-09-22 14:41:37,721 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-09-22 14:41:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:41:37,732 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:41:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:41:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:41:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:41:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:41:37,733 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:41:37,733 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:41:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:41:37,734 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:41:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:41:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:41:37,734 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:41:37,735 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:41:37,736 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:41:39,147 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:41:39,148 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:41:39,150 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:41:39 BoogieIcfgContainer [2021-09-22 14:41:39,150 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:41:39,151 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:41:39,151 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:41:39,153 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:41:39,153 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:41:37" (1/3) ... [2021-09-22 14:41:39,154 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787c96c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:41:39, skipping insertion in model container [2021-09-22 14:41:39,154 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:41:37" (2/3) ... [2021-09-22 14:41:39,155 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@787c96c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:41:39, skipping insertion in model container [2021-09-22 14:41:39,155 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:41:39" (3/3) ... [2021-09-22 14:41:39,156 INFO L111 eAbstractionObserver]: Analyzing ICFG mix028_pso.oepc.i [2021-09-22 14:41:39,159 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:41:39,159 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:41:39,159 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:41:39,159 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:41:39,203 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,204 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,205 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,205 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,206 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,207 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,208 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,209 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,210 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,211 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,212 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,213 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,214 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,215 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,216 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,217 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,218 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,220 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,221 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,222 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,223 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,224 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,225 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,226 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,227 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,229 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,230 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,232 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,233 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,234 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,235 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,236 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,237 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,237 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,238 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:41:39,239 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:41:39,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:41:39,267 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-09-22 14:41:39,267 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-22 14:41:39,275 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:41:39,280 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 116 places, 108 transitions, 231 flow [2021-09-22 14:41:39,282 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 116 places, 108 transitions, 231 flow [2021-09-22 14:41:39,283 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 116 places, 108 transitions, 231 flow [2021-09-22 14:41:39,307 INFO L129 PetriNetUnfolder]: 2/105 cut-off events. [2021-09-22 14:41:39,307 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:41:39,309 INFO L84 FinitePrefix]: Finished finitePrefix Result has 115 conditions, 105 events. 2/105 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 57 event pairs, 0 based on Foata normal form. 0/101 useless extension candidates. Maximal degree in co-relation 69. Up to 2 conditions per place. [2021-09-22 14:41:39,311 INFO L116 LiptonReduction]: Number of co-enabled transitions 1962 [2021-09-22 14:41:42,432 INFO L131 LiptonReduction]: Checked pairs total: 5539 [2021-09-22 14:41:42,432 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-09-22 14:41:42,451 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2021-09-22 14:41:42,501 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1034 states, 1031 states have (on average 3.3850630455868087) internal successors, (3490), 1033 states have internal predecessors, (3490), 0 states have call successors, (0), 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-09-22 14:41:42,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 1034 states, 1031 states have (on average 3.3850630455868087) internal successors, (3490), 1033 states have internal predecessors, (3490), 0 states have call successors, (0), 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-09-22 14:41:42,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-09-22 14:41:42,508 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:42,509 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-09-22 14:41:42,509 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:42,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:42,513 INFO L82 PathProgramCache]: Analyzing trace with hash 1092350, now seen corresponding path program 1 times [2021-09-22 14:41:42,520 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:42,521 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608692640] [2021-09-22 14:41:42,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:42,522 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:42,704 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:42,704 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608692640] [2021-09-22 14:41:42,705 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608692640] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:42,705 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:42,706 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:41:42,707 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695004378] [2021-09-22 14:41:42,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:41:42,711 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:42,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:41:42,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:41:42,735 INFO L87 Difference]: Start difference. First operand has 1034 states, 1031 states have (on average 3.3850630455868087) internal successors, (3490), 1033 states have internal predecessors, (3490), 0 states have call successors, (0), 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 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-09-22 14:41:42,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:42,787 INFO L93 Difference]: Finished difference Result 842 states and 2654 transitions. [2021-09-22 14:41:42,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:41:42,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2021-09-22 14:41:42,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:42,808 INFO L225 Difference]: With dead ends: 842 [2021-09-22 14:41:42,808 INFO L226 Difference]: Without dead ends: 812 [2021-09-22 14:41:42,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:41:42,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-09-22 14:41:42,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2021-09-22 14:41:42,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.1750924784217016) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 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-09-22 14:41:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2021-09-22 14:41:42,881 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2021-09-22 14:41:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:42,882 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2021-09-22 14:41:42,882 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 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-09-22 14:41:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2021-09-22 14:41:42,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-22 14:41:42,883 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:42,884 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:42,884 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:41:42,884 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:42,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:42,884 INFO L82 PathProgramCache]: Analyzing trace with hash -854821420, now seen corresponding path program 1 times [2021-09-22 14:41:42,885 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:42,885 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756970444] [2021-09-22 14:41:42,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:42,885 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:42,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:43,007 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:43,008 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:43,008 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756970444] [2021-09-22 14:41:43,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756970444] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:43,008 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:43,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:41:43,008 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14195528] [2021-09-22 14:41:43,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:41:43,009 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:43,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:41:43,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:41:43,010 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:41:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:43,030 INFO L93 Difference]: Finished difference Result 942 states and 2874 transitions. [2021-09-22 14:41:43,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:41:43,031 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-22 14:41:43,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:43,035 INFO L225 Difference]: With dead ends: 942 [2021-09-22 14:41:43,035 INFO L226 Difference]: Without dead ends: 792 [2021-09-22 14:41:43,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 792 states. [2021-09-22 14:41:43,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 792 to 792. [2021-09-22 14:41:43,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 792 states, 791 states have (on average 3.15929203539823) internal successors, (2499), 791 states have internal predecessors, (2499), 0 states have call successors, (0), 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-09-22 14:41:43,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 792 states to 792 states and 2499 transitions. [2021-09-22 14:41:43,073 INFO L78 Accepts]: Start accepts. Automaton has 792 states and 2499 transitions. Word has length 10 [2021-09-22 14:41:43,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:43,074 INFO L470 AbstractCegarLoop]: Abstraction has 792 states and 2499 transitions. [2021-09-22 14:41:43,074 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:41:43,074 INFO L276 IsEmpty]: Start isEmpty. Operand 792 states and 2499 transitions. [2021-09-22 14:41:43,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:41:43,081 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:43,082 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:43,082 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:41:43,083 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:43,087 INFO L82 PathProgramCache]: Analyzing trace with hash -726491017, now seen corresponding path program 1 times [2021-09-22 14:41:43,087 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:43,087 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167759739] [2021-09-22 14:41:43,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:43,088 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:43,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:43,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:43,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:43,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167759739] [2021-09-22 14:41:43,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167759739] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:43,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:43,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:41:43,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116286185] [2021-09-22 14:41:43,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:41:43,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:43,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:41:43,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:41:43,186 INFO L87 Difference]: Start difference. First operand 792 states and 2499 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:41:43,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:43,218 INFO L93 Difference]: Finished difference Result 897 states and 2733 transitions. [2021-09-22 14:41:43,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:41:43,237 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-22 14:41:43,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:43,241 INFO L225 Difference]: With dead ends: 897 [2021-09-22 14:41:43,241 INFO L226 Difference]: Without dead ends: 772 [2021-09-22 14:41:43,241 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:43,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2021-09-22 14:41:43,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 772. [2021-09-22 14:41:43,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 771 states have (on average 3.1426718547341115) internal successors, (2423), 771 states have internal predecessors, (2423), 0 states have call successors, (0), 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-09-22 14:41:43,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 2423 transitions. [2021-09-22 14:41:43,271 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 2423 transitions. Word has length 11 [2021-09-22 14:41:43,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:43,271 INFO L470 AbstractCegarLoop]: Abstraction has 772 states and 2423 transitions. [2021-09-22 14:41:43,273 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:41:43,274 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 2423 transitions. [2021-09-22 14:41:43,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:41:43,275 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:43,275 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:43,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:41:43,275 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:43,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:43,277 INFO L82 PathProgramCache]: Analyzing trace with hash -1404065538, now seen corresponding path program 1 times [2021-09-22 14:41:43,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:43,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253508232] [2021-09-22 14:41:43,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:43,278 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:43,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:43,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:43,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:43,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253508232] [2021-09-22 14:41:43,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253508232] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:43,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:43,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:41:43,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063765378] [2021-09-22 14:41:43,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:41:43,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:43,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:41:43,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:41:43,377 INFO L87 Difference]: Start difference. First operand 772 states and 2423 transitions. Second operand has 4 states, 3 states have (on average 4.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-09-22 14:41:43,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:43,433 INFO L93 Difference]: Finished difference Result 1474 states and 4448 transitions. [2021-09-22 14:41:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:41:43,434 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.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-09-22 14:41:43,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:43,442 INFO L225 Difference]: With dead ends: 1474 [2021-09-22 14:41:43,442 INFO L226 Difference]: Without dead ends: 1090 [2021-09-22 14:41:43,443 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 17.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:43,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2021-09-22 14:41:43,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 895. [2021-09-22 14:41:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 895 states, 894 states have (on average 3.0436241610738257) internal successors, (2721), 894 states have internal predecessors, (2721), 0 states have call successors, (0), 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-09-22 14:41:43,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 2721 transitions. [2021-09-22 14:41:43,464 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 2721 transitions. Word has length 12 [2021-09-22 14:41:43,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:43,465 INFO L470 AbstractCegarLoop]: Abstraction has 895 states and 2721 transitions. [2021-09-22 14:41:43,465 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.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-09-22 14:41:43,465 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 2721 transitions. [2021-09-22 14:41:43,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:41:43,466 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:43,466 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:43,466 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:41:43,467 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:43,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:43,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1682421184, now seen corresponding path program 1 times [2021-09-22 14:41:43,467 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:43,468 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581399259] [2021-09-22 14:41:43,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:43,468 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:43,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:43,597 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:43,597 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:43,598 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581399259] [2021-09-22 14:41:43,598 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581399259] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:43,598 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:43,598 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:41:43,598 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602987418] [2021-09-22 14:41:43,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:41:43,598 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:43,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:41:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:43,599 INFO L87 Difference]: Start difference. First operand 895 states and 2721 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-09-22 14:41:43,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:43,682 INFO L93 Difference]: Finished difference Result 1180 states and 3410 transitions. [2021-09-22 14:41:43,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:41:43,683 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-09-22 14:41:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:43,689 INFO L225 Difference]: With dead ends: 1180 [2021-09-22 14:41:43,689 INFO L226 Difference]: Without dead ends: 993 [2021-09-22 14:41:43,690 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 52.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:41:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2021-09-22 14:41:43,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 786. [2021-09-22 14:41:43,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.0012738853503187) internal successors, (2356), 785 states have internal predecessors, (2356), 0 states have call successors, (0), 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-09-22 14:41:43,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2356 transitions. [2021-09-22 14:41:43,743 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2356 transitions. Word has length 12 [2021-09-22 14:41:43,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:43,743 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 2356 transitions. [2021-09-22 14:41:43,743 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-09-22 14:41:43,743 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2356 transitions. [2021-09-22 14:41:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:41:43,744 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:43,745 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:43,745 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:41:43,745 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:43,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:43,745 INFO L82 PathProgramCache]: Analyzing trace with hash 618111932, now seen corresponding path program 1 times [2021-09-22 14:41:43,746 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:43,746 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600046682] [2021-09-22 14:41:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:43,746 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:43,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:43,829 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:43,830 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600046682] [2021-09-22 14:41:43,830 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600046682] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:43,830 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:43,830 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:41:43,830 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069783129] [2021-09-22 14:41:43,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:41:43,830 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:43,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:41:43,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:41:43,831 INFO L87 Difference]: Start difference. First operand 786 states and 2356 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-09-22 14:41:43,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:43,839 INFO L93 Difference]: Finished difference Result 510 states and 1280 transitions. [2021-09-22 14:41:43,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:41:43,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-09-22 14:41:43,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:43,842 INFO L225 Difference]: With dead ends: 510 [2021-09-22 14:41:43,842 INFO L226 Difference]: Without dead ends: 510 [2021-09-22 14:41:43,843 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:41:43,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-09-22 14:41:43,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-09-22 14:41:43,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.5147347740667976) internal successors, (1280), 509 states have internal predecessors, (1280), 0 states have call successors, (0), 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-09-22 14:41:43,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1280 transitions. [2021-09-22 14:41:43,867 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1280 transitions. Word has length 13 [2021-09-22 14:41:43,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:43,867 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1280 transitions. [2021-09-22 14:41:43,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 2 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-09-22 14:41:43,868 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1280 transitions. [2021-09-22 14:41:43,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-22 14:41:43,869 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:43,869 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:43,869 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:41:43,869 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:43,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:43,870 INFO L82 PathProgramCache]: Analyzing trace with hash -257580892, now seen corresponding path program 1 times [2021-09-22 14:41:43,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:43,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693704831] [2021-09-22 14:41:43,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:43,871 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:43,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:43,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:43,960 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:43,960 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693704831] [2021-09-22 14:41:43,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693704831] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:43,961 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:43,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:41:43,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339547236] [2021-09-22 14:41:43,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:41:43,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:43,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:41:43,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:43,962 INFO L87 Difference]: Start difference. First operand 510 states and 1280 transitions. Second operand has 5 states, 4 states have (on average 4.0) 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-09-22 14:41:44,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:44,008 INFO L93 Difference]: Finished difference Result 885 states and 2131 transitions. [2021-09-22 14:41:44,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-09-22 14:41:44,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) 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-09-22 14:41:44,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:44,011 INFO L225 Difference]: With dead ends: 885 [2021-09-22 14:41:44,011 INFO L226 Difference]: Without dead ends: 612 [2021-09-22 14:41:44,011 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:41:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2021-09-22 14:41:44,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 469. [2021-09-22 14:41:44,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 468 states have (on average 2.4316239316239314) internal successors, (1138), 468 states have internal predecessors, (1138), 0 states have call successors, (0), 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-09-22 14:41:44,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 1138 transitions. [2021-09-22 14:41:44,020 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 1138 transitions. Word has length 16 [2021-09-22 14:41:44,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:44,020 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 1138 transitions. [2021-09-22 14:41:44,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) 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-09-22 14:41:44,020 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 1138 transitions. [2021-09-22 14:41:44,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-22 14:41:44,021 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:44,021 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:44,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:41:44,021 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:44,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:44,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1975426401, now seen corresponding path program 1 times [2021-09-22 14:41:44,022 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:44,022 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1206366586] [2021-09-22 14:41:44,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:44,022 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:44,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:44,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:44,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:44,089 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1206366586] [2021-09-22 14:41:44,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1206366586] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:44,089 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:44,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:41:44,089 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196584960] [2021-09-22 14:41:44,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:41:44,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:44,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:41:44,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:41:44,090 INFO L87 Difference]: Start difference. First operand 469 states and 1138 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:41:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:44,126 INFO L93 Difference]: Finished difference Result 279 states and 598 transitions. [2021-09-22 14:41:44,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:41:44,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-22 14:41:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:44,127 INFO L225 Difference]: With dead ends: 279 [2021-09-22 14:41:44,128 INFO L226 Difference]: Without dead ends: 273 [2021-09-22 14:41:44,128 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:41:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2021-09-22 14:41:44,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 267. [2021-09-22 14:41:44,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 266 states have (on average 2.142857142857143) internal successors, (570), 266 states have internal predecessors, (570), 0 states have call successors, (0), 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-09-22 14:41:44,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 570 transitions. [2021-09-22 14:41:44,132 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 570 transitions. Word has length 16 [2021-09-22 14:41:44,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:44,132 INFO L470 AbstractCegarLoop]: Abstraction has 267 states and 570 transitions. [2021-09-22 14:41:44,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:41:44,133 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 570 transitions. [2021-09-22 14:41:44,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-09-22 14:41:44,133 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:44,133 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:41:44,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:41:44,133 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:44,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:44,134 INFO L82 PathProgramCache]: Analyzing trace with hash -1905319643, now seen corresponding path program 1 times [2021-09-22 14:41:44,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:44,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174064198] [2021-09-22 14:41:44,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:44,134 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:44,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:44,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:44,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:44,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174064198] [2021-09-22 14:41:44,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174064198] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:44,222 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:44,222 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:41:44,222 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [180518934] [2021-09-22 14:41:44,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:41:44,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:44,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:41:44,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:44,223 INFO L87 Difference]: Start difference. First operand 267 states and 570 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-09-22 14:41:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:44,237 INFO L93 Difference]: Finished difference Result 219 states and 478 transitions. [2021-09-22 14:41:44,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:41:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-09-22 14:41:44,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:44,239 INFO L225 Difference]: With dead ends: 219 [2021-09-22 14:41:44,239 INFO L226 Difference]: Without dead ends: 137 [2021-09-22 14:41:44,239 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:44,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-09-22 14:41:44,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 128. [2021-09-22 14:41:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.1653543307086616) internal successors, (275), 127 states have internal predecessors, (275), 0 states have call successors, (0), 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-09-22 14:41:44,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 275 transitions. [2021-09-22 14:41:44,242 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 275 transitions. Word has length 19 [2021-09-22 14:41:44,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:44,243 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 275 transitions. [2021-09-22 14:41:44,243 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 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-09-22 14:41:44,243 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 275 transitions. [2021-09-22 14:41:44,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-22 14:41:44,243 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:44,243 INFO L512 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] [2021-09-22 14:41:44,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:41:44,243 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:44,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:44,244 INFO L82 PathProgramCache]: Analyzing trace with hash 389340320, now seen corresponding path program 1 times [2021-09-22 14:41:44,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:44,244 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800070028] [2021-09-22 14:41:44,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:44,244 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:44,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:41:44,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:41:44,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:41:44,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800070028] [2021-09-22 14:41:44,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800070028] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:41:44,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:41:44,333 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:41:44,333 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455906048] [2021-09-22 14:41:44,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:41:44,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:41:44,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:41:44,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:41:44,334 INFO L87 Difference]: Start difference. First operand 128 states and 275 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-09-22 14:41:44,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:41:44,347 INFO L93 Difference]: Finished difference Result 176 states and 374 transitions. [2021-09-22 14:41:44,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:41:44,347 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2021-09-22 14:41:44,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:41:44,348 INFO L225 Difference]: With dead ends: 176 [2021-09-22 14:41:44,348 INFO L226 Difference]: Without dead ends: 112 [2021-09-22 14:41:44,348 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:41:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-09-22 14:41:44,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-09-22 14:41:44,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.1171171171171173) internal successors, (235), 111 states have internal predecessors, (235), 0 states have call successors, (0), 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-09-22 14:41:44,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 235 transitions. [2021-09-22 14:41:44,350 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 235 transitions. Word has length 23 [2021-09-22 14:41:44,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:41:44,351 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 235 transitions. [2021-09-22 14:41:44,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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-09-22 14:41:44,351 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 235 transitions. [2021-09-22 14:41:44,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-09-22 14:41:44,352 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:41:44,352 INFO L512 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] [2021-09-22 14:41:44,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:41:44,352 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:41:44,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:41:44,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1145723554, now seen corresponding path program 2 times [2021-09-22 14:41:44,352 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:41:44,353 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347112485] [2021-09-22 14:41:44,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:41:44,353 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:41:44,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:41:44,410 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:41:44,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:41:44,490 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:41:44,491 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:41:44,491 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:41:44,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:41:44,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:41:44,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:41:44,492 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:41:44,493 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:41:44,493 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:41:44,496 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:41:44,496 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:41:44,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:41:44 BasicIcfg [2021-09-22 14:41:44,584 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:41:44,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:41:44,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:41:44,585 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:41:44,585 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:41:39" (3/4) ... [2021-09-22 14:41:44,586 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:41:44,667 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:41:44,668 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:41:44,669 INFO L168 Benchmark]: Toolchain (without parser) took 7645.16 ms. Allocated memory was 52.4 MB in the beginning and 163.6 MB in the end (delta: 111.1 MB). Free memory was 28.0 MB in the beginning and 82.2 MB in the end (delta: -54.3 MB). Peak memory consumption was 55.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,669 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 52.4 MB. Free memory was 34.1 MB in the beginning and 34.1 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:41:44,669 INFO L168 Benchmark]: CACSL2BoogieTranslator took 540.00 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 27.8 MB in the beginning and 39.9 MB in the end (delta: -12.1 MB). Peak memory consumption was 3.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,670 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 69.2 MB. Free memory was 39.9 MB in the beginning and 37.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,670 INFO L168 Benchmark]: Boogie Preprocessor took 47.78 ms. Allocated memory is still 69.2 MB. Free memory was 37.3 MB in the beginning and 35.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,670 INFO L168 Benchmark]: RCFGBuilder took 1473.64 ms. Allocated memory was 69.2 MB in the beginning and 111.1 MB in the end (delta: 41.9 MB). Free memory was 35.0 MB in the beginning and 57.8 MB in the end (delta: -22.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,670 INFO L168 Benchmark]: TraceAbstraction took 5432.72 ms. Allocated memory was 111.1 MB in the beginning and 163.6 MB in the end (delta: 52.4 MB). Free memory was 57.8 MB in the beginning and 100.1 MB in the end (delta: -42.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,671 INFO L168 Benchmark]: Witness Printer took 83.32 ms. Allocated memory is still 163.6 MB. Free memory was 100.1 MB in the beginning and 82.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-09-22 14:41:44,672 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.10 ms. Allocated memory is still 52.4 MB. Free memory was 34.1 MB in the beginning and 34.1 MB in the end (delta: 33.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 540.00 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 27.8 MB in the beginning and 39.9 MB in the end (delta: -12.1 MB). Peak memory consumption was 3.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 61.30 ms. Allocated memory is still 69.2 MB. Free memory was 39.9 MB in the beginning and 37.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 47.78 ms. Allocated memory is still 69.2 MB. Free memory was 37.3 MB in the beginning and 35.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1473.64 ms. Allocated memory was 69.2 MB in the beginning and 111.1 MB in the end (delta: 41.9 MB). Free memory was 35.0 MB in the beginning and 57.8 MB in the end (delta: -22.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 5432.72 ms. Allocated memory was 111.1 MB in the beginning and 163.6 MB in the end (delta: 52.4 MB). Free memory was 57.8 MB in the beginning and 100.1 MB in the end (delta: -42.3 MB). Peak memory consumption was 66.3 MB. Max. memory is 16.1 GB. * Witness Printer took 83.32 ms. Allocated memory is still 163.6 MB. Free memory was 100.1 MB in the beginning and 82.2 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3150.3ms, 116 PlacesBefore, 38 PlacesAfterwards, 108 TransitionsBefore, 29 TransitionsAfterwards, 1962 CoEnabledTransitionPairs, 7 FixpointIterations, 38 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5539 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3420, positive: 3239, positive conditional: 0, positive unconditional: 3239, negative: 181, negative conditional: 0, negative unconditional: 181, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1514, positive: 1475, positive conditional: 0, positive unconditional: 1475, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1514, positive: 1445, positive conditional: 0, positive unconditional: 1445, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 69, positive: 30, positive conditional: 0, positive unconditional: 30, negative: 39, negative conditional: 0, negative unconditional: 39, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 244, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 212, negative conditional: 0, negative unconditional: 212, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3420, positive: 1764, positive conditional: 0, positive unconditional: 1764, negative: 142, negative conditional: 0, negative unconditional: 142, unknown: 1514, unknown conditional: 0, unknown unconditional: 1514] , Statistics on independence cache: Total cache size (in pairs): 208, Positive cache size: 186, Positive conditional cache size: 0, Positive unconditional cache size: 186, Negative cache size: 22, Negative conditional cache size: 0, Negative unconditional cache size: 22 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L714] 0 _Bool main$tmp_guard0; [L715] 0 _Bool main$tmp_guard1; [L717] 0 int x = 0; [L719] 0 int y = 0; [L721] 0 int z = 0; [L722] 0 _Bool z$flush_delayed; [L723] 0 int z$mem_tmp; [L724] 0 _Bool z$r_buff0_thd0; [L725] 0 _Bool z$r_buff0_thd1; [L726] 0 _Bool z$r_buff0_thd2; [L727] 0 _Bool z$r_buff0_thd3; [L728] 0 _Bool z$r_buff1_thd0; [L729] 0 _Bool z$r_buff1_thd1; [L730] 0 _Bool z$r_buff1_thd2; [L731] 0 _Bool z$r_buff1_thd3; [L732] 0 _Bool z$read_delayed; [L733] 0 int *z$read_delayed_var; [L734] 0 int z$w_buff0; [L735] 0 _Bool z$w_buff0_used; [L736] 0 int z$w_buff1; [L737] 0 _Bool z$w_buff1_used; [L738] 0 _Bool weak$$choice0; [L739] 0 _Bool weak$$choice2; [L836] 0 pthread_t t751; [L837] FCALL, FORK 0 pthread_create(&t751, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L743] 1 z$w_buff1 = z$w_buff0 [L744] 1 z$w_buff0 = 1 [L745] 1 z$w_buff1_used = z$w_buff0_used [L746] 1 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L748] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L749] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L750] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L751] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L752] 1 z$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L838] 0 pthread_t t752; [L839] FCALL, FORK 0 pthread_create(&t752, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 pthread_t t753; [L841] FCALL, FORK 0 pthread_create(&t753, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] EXPR 2 z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z [L778] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L778] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L779] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L779] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L780] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L780] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L781] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L781] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L782] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L782] 2 z$r_buff1_thd2 = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$r_buff1_thd2 [L785] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L787] 2 return 0; [L792] 3 y = 2 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 __unbuffered_p2_EAX = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=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=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L798] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L799] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L800] 3 z$flush_delayed = weak$$choice2 [L801] 3 z$mem_tmp = z [L802] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L802] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0) [L803] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L803] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1) [L804] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L804] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used) [L805] EXPR 3 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L805] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L806] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L806] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3) [L807] EXPR 3 weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L807] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L808] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L808] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L809] 3 __unbuffered_p2_EBX = z [L810] EXPR 3 z$flush_delayed ? z$mem_tmp : z [L810] 3 z = z$flush_delayed ? z$mem_tmp : z [L811] 3 z$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L814] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L814] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L815] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L815] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L816] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L816] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L817] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L818] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L818] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L758] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L758] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L759] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L759] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L760] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L760] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L761] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L761] 1 z$r_buff0_thd1 = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$r_buff0_thd1 [L762] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L762] 1 z$r_buff1_thd1 = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$r_buff1_thd1 [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L767] 1 return 0; [L821] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L823] 3 return 0; [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L847] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 837]: 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: 839]: 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: 841]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 136 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 5232.0ms, OverallIterations: 11, TraceHistogramMax: 1, EmptinessCheckTime: 21.1ms, AutomataDifference: 468.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 3234.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 301 SDtfs, 292 SDslu, 430 SDs, 0 SdLazy, 124 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 170.3ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 129.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1034occurred in iteration=0, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 247.2ms AutomataMinimizationTime, 10 MinimizatonAttempts, 560 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 41.5ms SsaConstructionTime, 424.8ms SatisfiabilityAnalysisTime, 513.0ms InterpolantComputationTime, 158 NumberOfCodeBlocks, 158 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 505 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 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-09-22 14:41:44,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...