./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix002_tso.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/mix002_tso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d697b16879333627c219b1fc3cade3fbac6f3418 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:37:25,631 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:37:25,633 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:37:25,675 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:37:25,675 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:37:25,678 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:37:25,680 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:37:25,684 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:37:25,686 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:37:25,690 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:37:25,691 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:37:25,694 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:37:25,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:37:25,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:37:25,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:37:25,701 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:37:25,702 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:37:25,703 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:37:25,705 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:37:25,710 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:37:25,711 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:37:25,712 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:37:25,713 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:37:25,714 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:37:25,720 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:37:25,720 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:37:25,720 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:37:25,722 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:37:25,722 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:37:25,723 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:37:25,723 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:37:25,724 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:37:25,725 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:37:25,726 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:37:25,727 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:37:25,727 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:37:25,728 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:37:25,728 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:37:25,728 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:37:25,729 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:37:25,730 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:37:25,734 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:37:25,769 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:37:25,769 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:37:25,770 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:37:25,770 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:37:25,772 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:37:25,772 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:37:25,772 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:37:25,773 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:37:25,773 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:37:25,773 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:37:25,774 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:37:25,774 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:37:25,774 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:37:25,774 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:37:25,774 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:37:25,775 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:37:25,775 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:37:25,775 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:37:25,775 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:37:25,775 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:37:25,775 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:37:25,776 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:37:25,776 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:37:25,776 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:37:25,776 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:37:25,776 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:37:25,781 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:37:25,781 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:37:25,782 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:37:25,782 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:37:25,782 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 -> d697b16879333627c219b1fc3cade3fbac6f3418 [2021-09-22 14:37:26,077 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:37:26,099 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:37:26,102 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:37:26,103 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:37:26,104 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:37:26,105 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix002_tso.oepc.i [2021-09-22 14:37:26,187 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166f482ee/06ae1a486d3b4cf195f62157943703fa/FLAG3f728ec53 [2021-09-22 14:37:26,719 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:37:26,720 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix002_tso.oepc.i [2021-09-22 14:37:26,739 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166f482ee/06ae1a486d3b4cf195f62157943703fa/FLAG3f728ec53 [2021-09-22 14:37:27,036 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/166f482ee/06ae1a486d3b4cf195f62157943703fa [2021-09-22 14:37:27,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:37:27,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:37:27,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:37:27,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:37:27,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:37:27,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,049 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bfbe84a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27, skipping insertion in model container [2021-09-22 14:37:27,049 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,054 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:37:27,104 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:37:27,217 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/mix002_tso.oepc.i[949,962] [2021-09-22 14:37:27,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:37:27,421 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:37:27,438 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/mix002_tso.oepc.i[949,962] [2021-09-22 14:37:27,499 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:37:27,529 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:37:27,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27 WrapperNode [2021-09-22 14:37:27,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:37:27,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:37:27,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:37:27,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:37:27,537 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:37:27" (1/1) ... [2021-09-22 14:37:27,552 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:37:27" (1/1) ... [2021-09-22 14:37:27,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:37:27,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:37:27,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:37:27,576 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:37:27,584 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,585 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,600 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,603 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,631 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,634 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:37:27,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:37:27,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:37:27,648 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:37:27,648 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (1/1) ... [2021-09-22 14:37:27,655 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:37:27,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:37:27,690 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:37:27,705 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:37:27,739 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:37:27,739 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:37:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:37:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:37:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:37:27,740 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:37:27,740 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:37:27,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:37:27,741 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:37:27,741 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:37:27,741 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:37:27,741 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:37:27,741 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:37:27,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:37:27,743 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:37:29,278 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:37:29,278 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:37:29,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:37:29 BoogieIcfgContainer [2021-09-22 14:37:29,281 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:37:29,282 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:37:29,282 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:37:29,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:37:29,285 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:37:27" (1/3) ... [2021-09-22 14:37:29,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4b6fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:37:29, skipping insertion in model container [2021-09-22 14:37:29,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:37:27" (2/3) ... [2021-09-22 14:37:29,286 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d4b6fc2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:37:29, skipping insertion in model container [2021-09-22 14:37:29,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:37:29" (3/3) ... [2021-09-22 14:37:29,288 INFO L111 eAbstractionObserver]: Analyzing ICFG mix002_tso.oepc.i [2021-09-22 14:37:29,292 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:37:29,292 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:37:29,293 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:37:29,293 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:37:29,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,329 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,329 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,330 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,330 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,330 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,332 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,333 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,334 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,335 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,336 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,337 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,338 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,338 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,339 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,339 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,339 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,340 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,343 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,344 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,344 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,345 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,345 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,345 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,346 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,347 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,348 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,349 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,350 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,351 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,353 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,354 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,355 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,356 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,361 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,362 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,367 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,368 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,369 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,370 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,371 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,374 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,375 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,376 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,382 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,383 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,384 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,385 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,386 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,388 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,389 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,391 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,392 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,395 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:37:29,397 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:37:29,452 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:37:29,457 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:37:29,457 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-22 14:37:29,477 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:37:29,486 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 124 places, 116 transitions, 247 flow [2021-09-22 14:37:29,489 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 124 places, 116 transitions, 247 flow [2021-09-22 14:37:29,490 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 124 places, 116 transitions, 247 flow [2021-09-22 14:37:29,526 INFO L129 PetriNetUnfolder]: 2/113 cut-off events. [2021-09-22 14:37:29,526 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:37:29,529 INFO L84 FinitePrefix]: Finished finitePrefix Result has 123 conditions, 113 events. 2/113 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 66 event pairs, 0 based on Foata normal form. 0/109 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-09-22 14:37:29,532 INFO L116 LiptonReduction]: Number of co-enabled transitions 2296 [2021-09-22 14:37:34,330 INFO L131 LiptonReduction]: Checked pairs total: 7058 [2021-09-22 14:37:34,330 INFO L133 LiptonReduction]: Total number of compositions: 98 [2021-09-22 14:37:34,338 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 39 places, 30 transitions, 75 flow [2021-09-22 14:37:34,414 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1180 states, 1177 states have (on average 3.427357689039932) internal successors, (4034), 1179 states have internal predecessors, (4034), 0 states have call successors, (0), 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:37:34,419 INFO L276 IsEmpty]: Start isEmpty. Operand has 1180 states, 1177 states have (on average 3.427357689039932) internal successors, (4034), 1179 states have internal predecessors, (4034), 0 states have call successors, (0), 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:37:34,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-09-22 14:37:34,423 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:34,424 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-09-22 14:37:34,424 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:37:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:34,430 INFO L82 PathProgramCache]: Analyzing trace with hash 1116935, now seen corresponding path program 1 times [2021-09-22 14:37:34,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:34,441 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754631893] [2021-09-22 14:37:34,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:34,442 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:34,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:34,629 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:37:34,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:34,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754631893] [2021-09-22 14:37:34,630 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754631893] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:34,630 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:34,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:37:34,631 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100053995] [2021-09-22 14:37:34,639 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:37:34,639 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:34,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:37:34,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:37:34,655 INFO L87 Difference]: Start difference. First operand has 1180 states, 1177 states have (on average 3.427357689039932) internal successors, (4034), 1179 states have internal predecessors, (4034), 0 states have call successors, (0), 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:37:34,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:34,753 INFO L93 Difference]: Finished difference Result 986 states and 3120 transitions. [2021-09-22 14:37:34,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:37:34,755 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:37:34,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:34,779 INFO L225 Difference]: With dead ends: 986 [2021-09-22 14:37:34,779 INFO L226 Difference]: Without dead ends: 950 [2021-09-22 14:37:34,780 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:37:34,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2021-09-22 14:37:34,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2021-09-22 14:37:34,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 949 states have (on average 3.1865121180189675) internal successors, (3024), 949 states have internal predecessors, (3024), 0 states have call successors, (0), 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:37:34,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 3024 transitions. [2021-09-22 14:37:34,866 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 3024 transitions. Word has length 3 [2021-09-22 14:37:34,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:34,866 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 3024 transitions. [2021-09-22 14:37:34,866 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:37:34,888 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 3024 transitions. [2021-09-22 14:37:34,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-22 14:37:34,889 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:34,889 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:37:34,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:37:34,890 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:37:34,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:34,891 INFO L82 PathProgramCache]: Analyzing trace with hash -465584288, now seen corresponding path program 1 times [2021-09-22 14:37:34,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:34,891 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252361522] [2021-09-22 14:37:34,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:34,892 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:34,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:35,106 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:37:35,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:35,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252361522] [2021-09-22 14:37:35,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252361522] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:35,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:35,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:37:35,107 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734430811] [2021-09-22 14:37:35,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:37:35,109 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:35,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:37:35,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:37:35,110 INFO L87 Difference]: Start difference. First operand 950 states and 3024 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:35,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:35,129 INFO L93 Difference]: Finished difference Result 942 states and 2992 transitions. [2021-09-22 14:37:35,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:37:35,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-09-22 14:37:35,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:35,136 INFO L225 Difference]: With dead ends: 942 [2021-09-22 14:37:35,136 INFO L226 Difference]: Without dead ends: 942 [2021-09-22 14:37:35,137 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:37:35,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-09-22 14:37:35,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2021-09-22 14:37:35,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 941 states have (on average 3.179596174282678) internal successors, (2992), 941 states have internal predecessors, (2992), 0 states have call successors, (0), 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:37:35,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 2992 transitions. [2021-09-22 14:37:35,166 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 2992 transitions. Word has length 9 [2021-09-22 14:37:35,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:35,167 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 2992 transitions. [2021-09-22 14:37:35,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:35,167 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 2992 transitions. [2021-09-22 14:37:35,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:37:35,172 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:35,173 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:37:35,173 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:37:35,174 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:37:35,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:35,174 INFO L82 PathProgramCache]: Analyzing trace with hash 216711357, now seen corresponding path program 1 times [2021-09-22 14:37:35,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:35,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912344917] [2021-09-22 14:37:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:35,175 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:35,302 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:37:35,302 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:35,302 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912344917] [2021-09-22 14:37:35,303 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912344917] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:35,303 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:35,303 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:37:35,303 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963869949] [2021-09-22 14:37:35,303 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:37:35,304 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:35,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:37:35,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:35,305 INFO L87 Difference]: Start difference. First operand 942 states and 2992 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:37:35,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:35,327 INFO L93 Difference]: Finished difference Result 878 states and 2760 transitions. [2021-09-22 14:37:35,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:37:35,327 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:37:35,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:35,333 INFO L225 Difference]: With dead ends: 878 [2021-09-22 14:37:35,333 INFO L226 Difference]: Without dead ends: 878 [2021-09-22 14:37:35,333 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.1ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:35,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2021-09-22 14:37:35,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 878. [2021-09-22 14:37:35,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 877 states have (on average 3.14709236031927) internal successors, (2760), 877 states have internal predecessors, (2760), 0 states have call successors, (0), 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:37:35,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 2760 transitions. [2021-09-22 14:37:35,360 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 2760 transitions. Word has length 11 [2021-09-22 14:37:35,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:35,360 INFO L470 AbstractCegarLoop]: Abstraction has 878 states and 2760 transitions. [2021-09-22 14:37:35,360 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:37:35,361 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 2760 transitions. [2021-09-22 14:37:35,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:37:35,362 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:35,362 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:37:35,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:37:35,363 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:37:35,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:35,363 INFO L82 PathProgramCache]: Analyzing trace with hash -749909642, now seen corresponding path program 1 times [2021-09-22 14:37:35,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:35,364 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294644693] [2021-09-22 14:37:35,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:35,364 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:35,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:35,437 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:37:35,438 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:35,438 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294644693] [2021-09-22 14:37:35,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294644693] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:35,438 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:35,438 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:37:35,438 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582963446] [2021-09-22 14:37:35,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:37:35,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:35,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:37:35,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:35,440 INFO L87 Difference]: Start difference. First operand 878 states and 2760 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:37:35,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:35,463 INFO L93 Difference]: Finished difference Result 830 states and 2588 transitions. [2021-09-22 14:37:35,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:37:35,464 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:37:35,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:35,469 INFO L225 Difference]: With dead ends: 830 [2021-09-22 14:37:35,469 INFO L226 Difference]: Without dead ends: 830 [2021-09-22 14:37:35,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:35,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 830 states. [2021-09-22 14:37:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 830 to 830. [2021-09-22 14:37:35,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 829 states have (on average 3.1218335343787698) internal successors, (2588), 829 states have internal predecessors, (2588), 0 states have call successors, (0), 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:37:35,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 2588 transitions. [2021-09-22 14:37:35,493 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 2588 transitions. Word has length 11 [2021-09-22 14:37:35,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:35,493 INFO L470 AbstractCegarLoop]: Abstraction has 830 states and 2588 transitions. [2021-09-22 14:37:35,493 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:37:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 2588 transitions. [2021-09-22 14:37:35,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:37:35,495 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:35,495 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:37:35,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:37:35,496 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:37:35,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:35,496 INFO L82 PathProgramCache]: Analyzing trace with hash 2101176211, now seen corresponding path program 1 times [2021-09-22 14:37:35,496 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:35,496 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775132298] [2021-09-22 14:37:35,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:35,497 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:35,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:35,579 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:37:35,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:35,580 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775132298] [2021-09-22 14:37:35,580 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775132298] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:35,580 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:35,580 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:37:35,581 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176412910] [2021-09-22 14:37:35,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:37:35,581 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:35,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:37:35,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:37:35,582 INFO L87 Difference]: Start difference. First operand 830 states and 2588 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:37:35,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:35,647 INFO L93 Difference]: Finished difference Result 852 states and 2656 transitions. [2021-09-22 14:37:35,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:37:35,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:37:35,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:35,653 INFO L225 Difference]: With dead ends: 852 [2021-09-22 14:37:35,653 INFO L226 Difference]: Without dead ends: 852 [2021-09-22 14:37:35,654 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 20.3ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:37:35,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 852 states. [2021-09-22 14:37:35,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 852 to 798. [2021-09-22 14:37:35,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 797 states have (on average 3.1066499372647427) internal successors, (2476), 797 states have internal predecessors, (2476), 0 states have call successors, (0), 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:37:35,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 2476 transitions. [2021-09-22 14:37:35,677 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 2476 transitions. Word has length 13 [2021-09-22 14:37:35,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:35,677 INFO L470 AbstractCegarLoop]: Abstraction has 798 states and 2476 transitions. [2021-09-22 14:37:35,677 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 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:37:35,677 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 2476 transitions. [2021-09-22 14:37:35,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:37:35,679 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:35,679 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:37:35,679 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:37:35,680 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:37:35,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:35,680 INFO L82 PathProgramCache]: Analyzing trace with hash 595696940, now seen corresponding path program 1 times [2021-09-22 14:37:35,680 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:35,680 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144999787] [2021-09-22 14:37:35,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:35,681 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:35,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:35,740 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:37:35,740 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:35,740 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144999787] [2021-09-22 14:37:35,740 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144999787] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:35,741 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:35,741 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:37:35,741 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288758616] [2021-09-22 14:37:35,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:37:35,741 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:35,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:37:35,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:37:35,742 INFO L87 Difference]: Start difference. First operand 798 states and 2476 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:35,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:35,756 INFO L93 Difference]: Finished difference Result 521 states and 1368 transitions. [2021-09-22 14:37:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:37:35,756 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-22 14:37:35,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:35,759 INFO L225 Difference]: With dead ends: 521 [2021-09-22 14:37:35,759 INFO L226 Difference]: Without dead ends: 521 [2021-09-22 14:37:35,759 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:37:35,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2021-09-22 14:37:35,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2021-09-22 14:37:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 520 states have (on average 2.6307692307692307) internal successors, (1368), 520 states have internal predecessors, (1368), 0 states have call successors, (0), 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:37:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1368 transitions. [2021-09-22 14:37:35,771 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1368 transitions. Word has length 15 [2021-09-22 14:37:35,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:35,771 INFO L470 AbstractCegarLoop]: Abstraction has 521 states and 1368 transitions. [2021-09-22 14:37:35,771 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:35,771 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1368 transitions. [2021-09-22 14:37:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-22 14:37:35,773 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:35,773 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:37:35,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:37:35,773 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:37:35,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1983234410, now seen corresponding path program 1 times [2021-09-22 14:37:35,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:35,774 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626885440] [2021-09-22 14:37:35,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:35,774 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:35,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:35,901 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:37:35,901 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:35,902 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626885440] [2021-09-22 14:37:35,902 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626885440] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:35,902 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:35,902 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:37:35,902 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835199951] [2021-09-22 14:37:35,902 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:37:35,902 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:35,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:37:35,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:35,904 INFO L87 Difference]: Start difference. First operand 521 states and 1368 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:35,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:35,920 INFO L93 Difference]: Finished difference Result 344 states and 837 transitions. [2021-09-22 14:37:35,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:37:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-22 14:37:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:35,922 INFO L225 Difference]: With dead ends: 344 [2021-09-22 14:37:35,922 INFO L226 Difference]: Without dead ends: 344 [2021-09-22 14:37:35,923 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:35,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2021-09-22 14:37:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2021-09-22 14:37:35,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 343 states have (on average 2.4402332361516037) internal successors, (837), 343 states have internal predecessors, (837), 0 states have call successors, (0), 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:37:35,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 837 transitions. [2021-09-22 14:37:35,930 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 837 transitions. Word has length 18 [2021-09-22 14:37:35,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:35,931 INFO L470 AbstractCegarLoop]: Abstraction has 344 states and 837 transitions. [2021-09-22 14:37:35,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:35,931 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 837 transitions. [2021-09-22 14:37:35,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:37:35,932 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:35,932 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] [2021-09-22 14:37:35,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:37:35,933 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:37:35,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:35,933 INFO L82 PathProgramCache]: Analyzing trace with hash -239152092, now seen corresponding path program 1 times [2021-09-22 14:37:35,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:35,934 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804653905] [2021-09-22 14:37:35,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:35,934 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:35,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:36,012 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:37:36,012 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:36,013 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804653905] [2021-09-22 14:37:36,013 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804653905] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:36,013 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:36,013 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:37:36,013 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381592858] [2021-09-22 14:37:36,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:37:36,014 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:36,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:37:36,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:37:36,015 INFO L87 Difference]: Start difference. First operand 344 states and 837 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:36,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:36,032 INFO L93 Difference]: Finished difference Result 305 states and 759 transitions. [2021-09-22 14:37:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:37:36,033 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2021-09-22 14:37:36,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:36,034 INFO L225 Difference]: With dead ends: 305 [2021-09-22 14:37:36,034 INFO L226 Difference]: Without dead ends: 305 [2021-09-22 14:37:36,035 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:37:36,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2021-09-22 14:37:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2021-09-22 14:37:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 2.4967105263157894) internal successors, (759), 304 states have internal predecessors, (759), 0 states have call successors, (0), 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:37:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 759 transitions. [2021-09-22 14:37:36,042 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 759 transitions. Word has length 21 [2021-09-22 14:37:36,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:36,042 INFO L470 AbstractCegarLoop]: Abstraction has 305 states and 759 transitions. [2021-09-22 14:37:36,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:36,042 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 759 transitions. [2021-09-22 14:37:36,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-22 14:37:36,043 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:36,043 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, 1] [2021-09-22 14:37:36,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:37:36,044 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:37:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:36,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1405061998, now seen corresponding path program 1 times [2021-09-22 14:37:36,045 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:36,045 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138032229] [2021-09-22 14:37:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:36,045 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:37:36,199 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:37:36,199 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:37:36,200 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138032229] [2021-09-22 14:37:36,200 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138032229] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:37:36,201 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:37:36,201 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:37:36,201 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094946306] [2021-09-22 14:37:36,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:37:36,202 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:37:36,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:37:36,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:37:36,203 INFO L87 Difference]: Start difference. First operand 305 states and 759 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:36,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:37:36,222 INFO L93 Difference]: Finished difference Result 397 states and 968 transitions. [2021-09-22 14:37:36,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:37:36,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2021-09-22 14:37:36,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:37:36,225 INFO L225 Difference]: With dead ends: 397 [2021-09-22 14:37:36,225 INFO L226 Difference]: Without dead ends: 215 [2021-09-22 14:37:36,225 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:37:36,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2021-09-22 14:37:36,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2021-09-22 14:37:36,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 215 states, 214 states have (on average 2.3551401869158877) internal successors, (504), 214 states have internal predecessors, (504), 0 states have call successors, (0), 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:37:36,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 504 transitions. [2021-09-22 14:37:36,231 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 504 transitions. Word has length 24 [2021-09-22 14:37:36,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:37:36,231 INFO L470 AbstractCegarLoop]: Abstraction has 215 states and 504 transitions. [2021-09-22 14:37:36,231 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:37:36,231 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 504 transitions. [2021-09-22 14:37:36,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-09-22 14:37:36,232 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:37:36,232 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, 1] [2021-09-22 14:37:36,232 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:37:36,233 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:37:36,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:37:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash -317118512, now seen corresponding path program 2 times [2021-09-22 14:37:36,233 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:37:36,233 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120303409] [2021-09-22 14:37:36,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:37:36,234 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:37:36,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:37:36,301 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:37:36,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:37:36,390 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:37:36,391 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:37:36,391 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:37:36,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:37:36,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:37:36,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:37:36,393 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:37:36,394 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:37:36,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:37:36,399 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:37:36,399 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:37:36,486 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:37:36 BasicIcfg [2021-09-22 14:37:36,498 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:37:36,499 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:37:36,499 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:37:36,499 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:37:36,500 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:37:29" (3/4) ... [2021-09-22 14:37:36,501 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:37:36,629 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:37:36,629 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:37:36,631 INFO L168 Benchmark]: Toolchain (without parser) took 9591.15 ms. Allocated memory was 50.3 MB in the beginning and 157.3 MB in the end (delta: 107.0 MB). Free memory was 26.1 MB in the beginning and 117.0 MB in the end (delta: -90.9 MB). Peak memory consumption was 102.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:37:36,631 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:37:36,632 INFO L168 Benchmark]: CACSL2BoogieTranslator took 490.38 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.9 MB in the beginning and 32.5 MB in the end (delta: -6.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:37:36,632 INFO L168 Benchmark]: Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 60.8 MB. Free memory was 32.3 MB in the beginning and 29.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:37:36,632 INFO L168 Benchmark]: Boogie Preprocessor took 66.26 ms. Allocated memory is still 60.8 MB. Free memory was 29.8 MB in the beginning and 27.7 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:37:36,633 INFO L168 Benchmark]: RCFGBuilder took 1633.70 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 43.1 MB in the beginning and 47.0 MB in the end (delta: -3.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:37:36,633 INFO L168 Benchmark]: TraceAbstraction took 7216.19 ms. Allocated memory was 73.4 MB in the beginning and 157.3 MB in the end (delta: 83.9 MB). Free memory was 46.6 MB in the beginning and 46.0 MB in the end (delta: 630.4 kB). Peak memory consumption was 84.7 MB. Max. memory is 16.1 GB. [2021-09-22 14:37:36,633 INFO L168 Benchmark]: Witness Printer took 130.58 ms. Allocated memory is still 157.3 MB. Free memory was 46.0 MB in the beginning and 117.0 MB in the end (delta: -71.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. [2021-09-22 14:37:36,635 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.17 ms. Allocated memory is still 50.3 MB. Free memory was 32.5 MB in the beginning and 32.5 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 490.38 ms. Allocated memory was 50.3 MB in the beginning and 60.8 MB in the end (delta: 10.5 MB). Free memory was 25.9 MB in the beginning and 32.5 MB in the end (delta: -6.6 MB). Peak memory consumption was 5.3 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 44.65 ms. Allocated memory is still 60.8 MB. Free memory was 32.3 MB in the beginning and 29.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 66.26 ms. Allocated memory is still 60.8 MB. Free memory was 29.8 MB in the beginning and 27.7 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1633.70 ms. Allocated memory was 60.8 MB in the beginning and 73.4 MB in the end (delta: 12.6 MB). Free memory was 43.1 MB in the beginning and 47.0 MB in the end (delta: -3.9 MB). Peak memory consumption was 27.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7216.19 ms. Allocated memory was 73.4 MB in the beginning and 157.3 MB in the end (delta: 83.9 MB). Free memory was 46.6 MB in the beginning and 46.0 MB in the end (delta: 630.4 kB). Peak memory consumption was 84.7 MB. Max. memory is 16.1 GB. * Witness Printer took 130.58 ms. Allocated memory is still 157.3 MB. Free memory was 46.0 MB in the beginning and 117.0 MB in the end (delta: -71.1 MB). Peak memory consumption was 14.7 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4841.6ms, 124 PlacesBefore, 39 PlacesAfterwards, 116 TransitionsBefore, 30 TransitionsAfterwards, 2296 CoEnabledTransitionPairs, 8 FixpointIterations, 43 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 98 TotalNumberOfCompositions, 7058 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3828, positive: 3597, positive conditional: 0, positive unconditional: 3597, negative: 231, negative conditional: 0, negative unconditional: 231, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1784, positive: 1720, positive conditional: 0, positive unconditional: 1720, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1784, positive: 1701, positive conditional: 0, positive unconditional: 1701, negative: 83, negative conditional: 0, negative unconditional: 83, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 83, positive: 19, positive conditional: 0, positive unconditional: 19, negative: 64, negative conditional: 0, negative unconditional: 64, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 283, positive: 32, positive conditional: 0, positive unconditional: 32, negative: 250, negative conditional: 0, negative unconditional: 250, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3828, positive: 1877, positive conditional: 0, positive unconditional: 1877, negative: 167, negative conditional: 0, negative unconditional: 167, unknown: 1784, unknown conditional: 0, unknown unconditional: 1784] , Statistics on independence cache: Total cache size (in pairs): 207, Positive cache size: 184, Positive conditional cache size: 0, Positive unconditional cache size: 184, Negative cache size: 23, Negative conditional cache size: 0, Negative unconditional cache size: 23 - 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_p0_EAX = 0; [L713] 0 int __unbuffered_p0_EBX = 0; [L715] 0 int __unbuffered_p1_EAX = 0; [L717] 0 int __unbuffered_p1_EBX = 0; [L719] 0 int __unbuffered_p2_EAX = 0; [L721] 0 int __unbuffered_p2_EBX = 0; [L723] 0 int a = 0; [L724] 0 _Bool a$flush_delayed; [L725] 0 int a$mem_tmp; [L726] 0 _Bool a$r_buff0_thd0; [L727] 0 _Bool a$r_buff0_thd1; [L728] 0 _Bool a$r_buff0_thd2; [L729] 0 _Bool a$r_buff0_thd3; [L730] 0 _Bool a$r_buff1_thd0; [L731] 0 _Bool a$r_buff1_thd1; [L732] 0 _Bool a$r_buff1_thd2; [L733] 0 _Bool a$r_buff1_thd3; [L734] 0 _Bool a$read_delayed; [L735] 0 int *a$read_delayed_var; [L736] 0 int a$w_buff0; [L737] 0 _Bool a$w_buff0_used; [L738] 0 int a$w_buff1; [L739] 0 _Bool a$w_buff1_used; [L740] 0 _Bool main$tmp_guard0; [L741] 0 _Bool main$tmp_guard1; [L743] 0 int x = 0; [L745] 0 int y = 0; [L747] 0 int z = 0; [L748] 0 _Bool weak$$choice0; [L749] 0 _Bool weak$$choice2; [L855] 0 pthread_t t56; [L856] FCALL, FORK 0 pthread_create(&t56, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L857] 0 pthread_t t57; [L753] 1 a$w_buff1 = a$w_buff0 [L754] 1 a$w_buff0 = 1 [L755] 1 a$w_buff1_used = a$w_buff0_used [L756] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L758] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L759] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L760] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L761] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L762] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L765] 1 x = 1 [L768] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L858] FCALL, FORK 0 pthread_create(&t57, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L859] 0 pthread_t t58; [L860] FCALL, FORK 0 pthread_create(&t58, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L771] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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] [L788] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L791] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L794] 2 __unbuffered_p1_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L811] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L797] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L797] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L798] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L798] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L799] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L799] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L800] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L800] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L801] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L801] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L804] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L806] 2 return 0; [L814] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1] [L817] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L818] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L819] 3 a$flush_delayed = weak$$choice2 [L820] 3 a$mem_tmp = a [L821] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L821] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0) [L822] EXPR 3 weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L822] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1) [L823] EXPR 3 weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L823] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used) [L824] EXPR 3 weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L824] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L825] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L825] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3) [L826] EXPR 3 weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L826] 3 a$r_buff0_thd3 = weak$$choice2 ? a$r_buff0_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff0_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3)) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0) [L827] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L827] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L828] 3 __unbuffered_p2_EBX = a [L829] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L829] 3 a = a$flush_delayed ? a$mem_tmp : a [L830] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L774] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L774] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L775] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L775] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L776] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L776] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L777] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L777] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L778] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L778] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L781] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L783] 1 return 0; [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L833] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L833] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L834] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L834] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L835] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L835] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L836] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L836] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L837] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L837] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L840] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L842] 3 return 0; [L862] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L866] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L866] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L867] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L867] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L868] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L868] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L869] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L869] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L870] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L870] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L873] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 1 && __unbuffered_p0_EBX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 0 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 0) [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=1, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, y=1, z=1] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 858]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 860]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 147 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 6946.2ms, OverallIterations: 10, TraceHistogramMax: 1, EmptinessCheckTime: 23.8ms, AutomataDifference: 382.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4957.5ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 226 SDtfs, 218 SDslu, 232 SDs, 0 SdLazy, 101 SolverSat, 22 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 131.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 69.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1180occurred in iteration=0, InterpolantAutomatonStates: 32, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 205.7ms AutomataMinimizationTime, 9 MinimizatonAttempts, 54 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 49.5ms SsaConstructionTime, 463.0ms SatisfiabilityAnalysisTime, 538.1ms InterpolantComputationTime, 149 NumberOfCodeBlocks, 149 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 116 ConstructedInterpolants, 0 QuantifiedInterpolants, 720 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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:37:36,685 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...