./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix045_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/mix045_pso.oepc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c70124b1fef01505fc51c84d642537736e7d9129 ...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-20ed64e [2021-08-26 14:31:59,722 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:31:59,724 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:31:59,766 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:31:59,766 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:31:59,771 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:31:59,772 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:31:59,778 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:31:59,780 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:31:59,784 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:31:59,785 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:31:59,789 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:31:59,789 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:31:59,791 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:31:59,793 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:31:59,797 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:31:59,798 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:31:59,799 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:31:59,801 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:31:59,804 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:31:59,808 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:31:59,809 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:31:59,811 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:31:59,812 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:31:59,814 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:31:59,814 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:31:59,814 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:31:59,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:31:59,815 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:31:59,816 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:31:59,816 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:31:59,817 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:31:59,817 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:31:59,818 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:31:59,819 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:31:59,819 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:31:59,820 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:31:59,820 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:31:59,820 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:31:59,821 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:31:59,822 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:31:59,823 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:31:59,859 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:31:59,860 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:31:59,861 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:31:59,861 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:31:59,862 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:31:59,863 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:31:59,863 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:31:59,863 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:31:59,863 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:31:59,863 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:31:59,864 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:31:59,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:31:59,864 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:31:59,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:31:59,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:31:59,865 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:31:59,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:31:59,865 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:31:59,866 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:31:59,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:31:59,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:31:59,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:31:59,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:31:59,866 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:31:59,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:31:59,874 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:31:59,874 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:31:59,874 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:31:59,874 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:31:59,874 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:31:59,874 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 -> c70124b1fef01505fc51c84d642537736e7d9129 [2021-08-26 14:32:00,173 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:32:00,207 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:32:00,210 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:32:00,211 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:32:00,211 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:32:00,212 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix045_pso.oepc.i [2021-08-26 14:32:00,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f5a7c03/c9ae379822084fe5a05b8f0a7a6722db/FLAG9bc6bad75 [2021-08-26 14:32:00,796 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:32:00,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix045_pso.oepc.i [2021-08-26 14:32:00,820 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f5a7c03/c9ae379822084fe5a05b8f0a7a6722db/FLAG9bc6bad75 [2021-08-26 14:32:01,094 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5f5a7c03/c9ae379822084fe5a05b8f0a7a6722db [2021-08-26 14:32:01,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:32:01,100 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:32:01,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:32:01,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:32:01,106 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:32:01,106 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,109 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 26.08 02:32:01, skipping insertion in model container [2021-08-26 14:32:01,109 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,116 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:32:01,164 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:32:01,360 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/mix045_pso.oepc.i[949,962] [2021-08-26 14:32:01,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:32:01,559 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:32:01,568 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/mix045_pso.oepc.i[949,962] [2021-08-26 14:32:01,602 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:32:01,632 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:32:01,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01 WrapperNode [2021-08-26 14:32:01,633 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:32:01,634 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:32:01,634 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:32:01,634 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:32:01,640 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,710 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:32:01,712 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:32:01,712 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:32:01,712 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:32:01,719 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,719 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,740 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,740 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,763 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,765 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,769 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:32:01,770 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:32:01,771 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:32:01,771 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:32:01,772 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (1/1) ... [2021-08-26 14:32:01,797 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:32:01,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:32:01,814 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 14:32:01,842 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 14:32:01,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:32:01,858 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-26 14:32:01,859 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:32:01,859 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:32:01,859 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-26 14:32:01,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-26 14:32:01,859 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-26 14:32:01,859 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-26 14:32:01,860 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-26 14:32:01,860 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-26 14:32:01,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:32:01,860 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-26 14:32:01,860 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:32:01,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:32:01,862 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:32:03,548 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:32:03,549 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-26 14:32:03,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:32:03 BoogieIcfgContainer [2021-08-26 14:32:03,551 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:32:03,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:32:03,553 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:32:03,556 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:32:03,556 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:32:01" (1/3) ... [2021-08-26 14:32:03,556 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b4bfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:32:03, skipping insertion in model container [2021-08-26 14:32:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:32:01" (2/3) ... [2021-08-26 14:32:03,557 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50b4bfe9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:32:03, skipping insertion in model container [2021-08-26 14:32:03,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:32:03" (3/3) ... [2021-08-26 14:32:03,558 INFO L111 eAbstractionObserver]: Analyzing ICFG mix045_pso.oepc.i [2021-08-26 14:32:03,563 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:32:03,563 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:32:03,563 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 14:32:03,563 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:32:03,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,600 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,600 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,601 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,601 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,601 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,601 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,602 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,602 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,603 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,603 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,604 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,605 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,606 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,607 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,607 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,607 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,607 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,608 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,608 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,609 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,610 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,611 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,612 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,612 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,612 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,613 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,613 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,614 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,615 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,616 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,617 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,618 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,619 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,621 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,640 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,641 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,642 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,643 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,644 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,647 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,648 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,649 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,650 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,651 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,653 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,654 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,655 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,655 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,657 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,657 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,658 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,658 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,659 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,661 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,662 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,662 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,663 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,664 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~nondet17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,664 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,665 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,666 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:32:03,668 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-26 14:32:03,701 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:32:03,707 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 14:32:03,707 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-26 14:32:03,718 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:32:03,726 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 118 places, 110 transitions, 235 flow [2021-08-26 14:32:03,728 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 118 places, 110 transitions, 235 flow [2021-08-26 14:32:03,729 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 118 places, 110 transitions, 235 flow [2021-08-26 14:32:03,763 INFO L129 PetriNetUnfolder]: 2/107 cut-off events. [2021-08-26 14:32:03,763 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-26 14:32:03,766 INFO L84 FinitePrefix]: Finished finitePrefix Result has 117 conditions, 107 events. 2/107 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 63 event pairs, 0 based on Foata normal form. 0/103 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2021-08-26 14:32:03,769 INFO L116 LiptonReduction]: Number of co-enabled transitions 2048 [2021-08-26 14:32:09,806 INFO L131 LiptonReduction]: Checked pairs total: 5725 [2021-08-26 14:32:09,806 INFO L133 LiptonReduction]: Total number of compositions: 92 [2021-08-26 14:32:09,812 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 38 places, 29 transitions, 73 flow [2021-08-26 14:32:09,863 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 1034 states, 1031 states have (on average 3.3850630455868087) internal successors, (3490), 1033 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:09,867 INFO L276 IsEmpty]: Start isEmpty. Operand has 1034 states, 1031 states have (on average 3.3850630455868087) internal successors, (3490), 1033 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:09,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-08-26 14:32:09,870 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:09,871 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-08-26 14:32:09,871 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:09,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:09,875 INFO L82 PathProgramCache]: Analyzing trace with hash 1097181, now seen corresponding path program 1 times [2021-08-26 14:32:09,882 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:09,883 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144415321] [2021-08-26 14:32:09,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:09,883 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:10,050 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:10,050 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144415321] [2021-08-26 14:32:10,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144415321] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:10,051 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:10,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:32:10,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711516325] [2021-08-26 14:32:10,056 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:32:10,056 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:10,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:32:10,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:10,071 INFO L87 Difference]: Start difference. First operand has 1034 states, 1031 states have (on average 3.3850630455868087) internal successors, (3490), 1033 states have internal predecessors, (3490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:10,140 INFO L93 Difference]: Finished difference Result 842 states and 2654 transitions. [2021-08-26 14:32:10,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:32:10,142 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-08-26 14:32:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:10,158 INFO L225 Difference]: With dead ends: 842 [2021-08-26 14:32:10,159 INFO L226 Difference]: Without dead ends: 812 [2021-08-26 14:32:10,160 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:32:10,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2021-08-26 14:32:10,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 812. [2021-08-26 14:32:10,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 812 states, 811 states have (on average 3.1750924784217016) internal successors, (2575), 811 states have internal predecessors, (2575), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 812 states to 812 states and 2575 transitions. [2021-08-26 14:32:10,247 INFO L78 Accepts]: Start accepts. Automaton has 812 states and 2575 transitions. Word has length 3 [2021-08-26 14:32:10,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:10,248 INFO L470 AbstractCegarLoop]: Abstraction has 812 states and 2575 transitions. [2021-08-26 14:32:10,248 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-08-26 14:32:10,248 INFO L276 IsEmpty]: Start isEmpty. Operand 812 states and 2575 transitions. [2021-08-26 14:32:10,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 14:32:10,250 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:10,250 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:10,250 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:32:10,250 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:10,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:10,251 INFO L82 PathProgramCache]: Analyzing trace with hash -1052805704, now seen corresponding path program 1 times [2021-08-26 14:32:10,251 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:10,251 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796175719] [2021-08-26 14:32:10,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:10,252 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:10,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:10,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:10,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:10,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796175719] [2021-08-26 14:32:10,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796175719] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:10,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:10,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:32:10,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999682706] [2021-08-26 14:32:10,371 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:32:10,371 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:10,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:32:10,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:32:10,373 INFO L87 Difference]: Start difference. First operand 812 states and 2575 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:10,457 INFO L93 Difference]: Finished difference Result 1606 states and 4867 transitions. [2021-08-26 14:32:10,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:10,458 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 14:32:10,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:10,468 INFO L225 Difference]: With dead ends: 1606 [2021-08-26 14:32:10,468 INFO L226 Difference]: Without dead ends: 1186 [2021-08-26 14:32:10,469 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 19.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:10,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1186 states. [2021-08-26 14:32:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1186 to 970. [2021-08-26 14:32:10,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 3.065015479876161) internal successors, (2970), 969 states have internal predecessors, (2970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 2970 transitions. [2021-08-26 14:32:10,528 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 2970 transitions. Word has length 10 [2021-08-26 14:32:10,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:10,529 INFO L470 AbstractCegarLoop]: Abstraction has 970 states and 2970 transitions. [2021-08-26 14:32:10,529 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,529 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 2970 transitions. [2021-08-26 14:32:10,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:32:10,531 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:10,531 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:10,531 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:32:10,532 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:10,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:10,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1415193674, now seen corresponding path program 1 times [2021-08-26 14:32:10,533 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:10,533 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295210247] [2021-08-26 14:32:10,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:10,533 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:10,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:10,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:10,618 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:10,618 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295210247] [2021-08-26 14:32:10,618 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295210247] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:10,619 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:10,619 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:10,619 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558452325] [2021-08-26 14:32:10,619 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:32:10,620 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:10,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:32:10,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:10,621 INFO L87 Difference]: Start difference. First operand 970 states and 2970 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:10,694 INFO L93 Difference]: Finished difference Result 1277 states and 3701 transitions. [2021-08-26 14:32:10,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:32:10,694 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:32:10,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:10,701 INFO L225 Difference]: With dead ends: 1277 [2021-08-26 14:32:10,701 INFO L226 Difference]: Without dead ends: 1048 [2021-08-26 14:32:10,702 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 29.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:10,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2021-08-26 14:32:10,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 802. [2021-08-26 14:32:10,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 801 states have (on average 3.016229712858926) internal successors, (2416), 801 states have internal predecessors, (2416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 2416 transitions. [2021-08-26 14:32:10,730 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 2416 transitions. Word has length 11 [2021-08-26 14:32:10,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:10,731 INFO L470 AbstractCegarLoop]: Abstraction has 802 states and 2416 transitions. [2021-08-26 14:32:10,731 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,731 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 2416 transitions. [2021-08-26 14:32:10,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 14:32:10,733 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:10,733 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:10,733 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:32:10,733 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:10,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:10,734 INFO L82 PathProgramCache]: Analyzing trace with hash 2147295622, now seen corresponding path program 1 times [2021-08-26 14:32:10,734 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:10,734 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31372161] [2021-08-26 14:32:10,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:10,735 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:10,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:10,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:10,789 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31372161] [2021-08-26 14:32:10,789 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31372161] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:10,789 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:10,789 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:32:10,789 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480479907] [2021-08-26 14:32:10,790 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:32:10,790 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:10,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:32:10,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:32:10,791 INFO L87 Difference]: Start difference. First operand 802 states and 2416 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:10,812 INFO L93 Difference]: Finished difference Result 886 states and 2599 transitions. [2021-08-26 14:32:10,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:10,813 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 14:32:10,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:10,818 INFO L225 Difference]: With dead ends: 886 [2021-08-26 14:32:10,818 INFO L226 Difference]: Without dead ends: 786 [2021-08-26 14:32:10,818 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:10,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 786 states. [2021-08-26 14:32:10,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 786 to 786. [2021-08-26 14:32:10,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 785 states have (on average 3.0012738853503187) internal successors, (2356), 785 states have internal predecessors, (2356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 2356 transitions. [2021-08-26 14:32:10,842 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 2356 transitions. Word has length 12 [2021-08-26 14:32:10,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:10,842 INFO L470 AbstractCegarLoop]: Abstraction has 786 states and 2356 transitions. [2021-08-26 14:32:10,842 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,843 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 2356 transitions. [2021-08-26 14:32:10,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:32:10,844 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:10,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:10,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:32:10,845 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:10,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:10,845 INFO L82 PathProgramCache]: Analyzing trace with hash 1784807428, now seen corresponding path program 1 times [2021-08-26 14:32:10,845 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:10,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909332222] [2021-08-26 14:32:10,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:10,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:10,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:10,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:10,908 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:10,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909332222] [2021-08-26 14:32:10,909 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909332222] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:10,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:10,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:10,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722905374] [2021-08-26 14:32:10,910 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:32:10,910 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:10,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:32:10,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:32:10,911 INFO L87 Difference]: Start difference. First operand 786 states and 2356 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:10,943 INFO L93 Difference]: Finished difference Result 690 states and 1788 transitions. [2021-08-26 14:32:10,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:10,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 14:32:10,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:10,947 INFO L225 Difference]: With dead ends: 690 [2021-08-26 14:32:10,947 INFO L226 Difference]: Without dead ends: 510 [2021-08-26 14:32:10,947 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:10,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2021-08-26 14:32:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 510. [2021-08-26 14:32:10,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 510 states, 509 states have (on average 2.5147347740667976) internal successors, (1280), 509 states have internal predecessors, (1280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 510 states to 510 states and 1280 transitions. [2021-08-26 14:32:10,960 INFO L78 Accepts]: Start accepts. Automaton has 510 states and 1280 transitions. Word has length 13 [2021-08-26 14:32:10,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:10,961 INFO L470 AbstractCegarLoop]: Abstraction has 510 states and 1280 transitions. [2021-08-26 14:32:10,961 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:10,961 INFO L276 IsEmpty]: Start isEmpty. Operand 510 states and 1280 transitions. [2021-08-26 14:32:10,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 14:32:10,962 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:10,962 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:10,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:32:10,963 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:10,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:10,963 INFO L82 PathProgramCache]: Analyzing trace with hash -1615140668, now seen corresponding path program 1 times [2021-08-26 14:32:10,963 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:10,964 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119228082] [2021-08-26 14:32:10,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:10,964 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:10,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:11,072 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:11,073 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:11,073 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119228082] [2021-08-26 14:32:11,073 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119228082] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:11,073 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:11,074 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:32:11,074 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664870448] [2021-08-26 14:32:11,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:32:11,074 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:11,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:32:11,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:11,075 INFO L87 Difference]: Start difference. First operand 510 states and 1280 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:11,117 INFO L93 Difference]: Finished difference Result 382 states and 872 transitions. [2021-08-26 14:32:11,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:32:11,118 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 14:32:11,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:11,119 INFO L225 Difference]: With dead ends: 382 [2021-08-26 14:32:11,119 INFO L226 Difference]: Without dead ends: 292 [2021-08-26 14:32:11,120 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 51.4ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:11,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-26 14:32:11,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 280. [2021-08-26 14:32:11,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 279 states have (on average 2.218637992831541) internal successors, (619), 279 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 619 transitions. [2021-08-26 14:32:11,127 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 619 transitions. Word has length 16 [2021-08-26 14:32:11,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:11,128 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 619 transitions. [2021-08-26 14:32:11,128 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,128 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 619 transitions. [2021-08-26 14:32:11,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-26 14:32:11,129 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:11,129 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:11,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:32:11,130 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:11,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:11,130 INFO L82 PathProgramCache]: Analyzing trace with hash 899643751, now seen corresponding path program 1 times [2021-08-26 14:32:11,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:11,131 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960594355] [2021-08-26 14:32:11,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:11,131 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:11,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:11,278 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:11,278 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:11,279 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960594355] [2021-08-26 14:32:11,279 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960594355] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:11,279 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:11,279 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:11,279 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710317694] [2021-08-26 14:32:11,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:32:11,280 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:32:11,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:11,281 INFO L87 Difference]: Start difference. First operand 280 states and 619 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:11,340 INFO L93 Difference]: Finished difference Result 244 states and 547 transitions. [2021-08-26 14:32:11,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:32:11,341 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-08-26 14:32:11,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:11,343 INFO L225 Difference]: With dead ends: 244 [2021-08-26 14:32:11,343 INFO L226 Difference]: Without dead ends: 177 [2021-08-26 14:32:11,344 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 25.7ms TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:11,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2021-08-26 14:32:11,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 168. [2021-08-26 14:32:11,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 2.317365269461078) internal successors, (387), 167 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 387 transitions. [2021-08-26 14:32:11,349 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 387 transitions. Word has length 19 [2021-08-26 14:32:11,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:11,349 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 387 transitions. [2021-08-26 14:32:11,349 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,349 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 387 transitions. [2021-08-26 14:32:11,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 14:32:11,350 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:11,350 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:11,350 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:32:11,351 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:11,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:11,351 INFO L82 PathProgramCache]: Analyzing trace with hash 1821601641, now seen corresponding path program 1 times [2021-08-26 14:32:11,351 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:11,352 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903104551] [2021-08-26 14:32:11,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:11,352 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:11,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:11,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:11,611 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:11,611 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903104551] [2021-08-26 14:32:11,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903104551] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:11,612 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:11,612 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:32:11,612 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102244164] [2021-08-26 14:32:11,613 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:32:11,613 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:11,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:32:11,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:32:11,614 INFO L87 Difference]: Start difference. First operand 168 states and 387 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:11,830 INFO L93 Difference]: Finished difference Result 328 states and 720 transitions. [2021-08-26 14:32:11,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-26 14:32:11,831 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 14:32:11,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:11,833 INFO L225 Difference]: With dead ends: 328 [2021-08-26 14:32:11,833 INFO L226 Difference]: Without dead ends: 266 [2021-08-26 14:32:11,833 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 103.4ms TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2021-08-26 14:32:11,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2021-08-26 14:32:11,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 188. [2021-08-26 14:32:11,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 187 states have (on average 2.2620320855614975) internal successors, (423), 187 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 423 transitions. [2021-08-26 14:32:11,838 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 423 transitions. Word has length 23 [2021-08-26 14:32:11,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:11,838 INFO L470 AbstractCegarLoop]: Abstraction has 188 states and 423 transitions. [2021-08-26 14:32:11,839 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 423 transitions. [2021-08-26 14:32:11,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 14:32:11,839 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:11,840 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:11,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:32:11,840 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:11,841 INFO L82 PathProgramCache]: Analyzing trace with hash -547684723, now seen corresponding path program 2 times [2021-08-26 14:32:11,841 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:11,841 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423435541] [2021-08-26 14:32:11,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:11,841 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:11,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:11,939 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:11,940 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:11,940 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423435541] [2021-08-26 14:32:11,940 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423435541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:11,940 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:11,940 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:32:11,940 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194397632] [2021-08-26 14:32:11,941 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:32:11,941 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:11,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:32:11,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:32:11,942 INFO L87 Difference]: Start difference. First operand 188 states and 423 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:11,957 INFO L93 Difference]: Finished difference Result 278 states and 620 transitions. [2021-08-26 14:32:11,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-26 14:32:11,958 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 14:32:11,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:11,959 INFO L225 Difference]: With dead ends: 278 [2021-08-26 14:32:11,959 INFO L226 Difference]: Without dead ends: 128 [2021-08-26 14:32:11,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:11,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2021-08-26 14:32:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2021-08-26 14:32:11,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 2.1496062992125986) internal successors, (273), 127 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 273 transitions. [2021-08-26 14:32:11,963 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 273 transitions. Word has length 23 [2021-08-26 14:32:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:11,963 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 273 transitions. [2021-08-26 14:32:11,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:11,963 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 273 transitions. [2021-08-26 14:32:11,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 14:32:11,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:11,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:11,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:32:11,965 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:11,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:11,965 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725459, now seen corresponding path program 3 times [2021-08-26 14:32:11,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:11,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672394326] [2021-08-26 14:32:11,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:11,966 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:12,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:12,093 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:12,093 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672394326] [2021-08-26 14:32:12,093 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672394326] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:12,094 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:12,094 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:32:12,094 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785341963] [2021-08-26 14:32:12,094 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:32:12,094 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:12,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:32:12,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:32:12,095 INFO L87 Difference]: Start difference. First operand 128 states and 273 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:12,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:12,127 INFO L93 Difference]: Finished difference Result 182 states and 383 transitions. [2021-08-26 14:32:12,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:32:12,127 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 14:32:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:12,128 INFO L225 Difference]: With dead ends: 182 [2021-08-26 14:32:12,128 INFO L226 Difference]: Without dead ends: 112 [2021-08-26 14:32:12,129 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 22.2ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:32:12,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2021-08-26 14:32:12,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2021-08-26 14:32:12,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 2.099099099099099) internal successors, (233), 111 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:12,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 233 transitions. [2021-08-26 14:32:12,132 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 233 transitions. Word has length 23 [2021-08-26 14:32:12,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:12,132 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 233 transitions. [2021-08-26 14:32:12,132 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:12,132 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 233 transitions. [2021-08-26 14:32:12,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 14:32:12,133 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:12,133 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:12,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:32:12,133 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:12,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:12,134 INFO L82 PathProgramCache]: Analyzing trace with hash 1770058821, now seen corresponding path program 4 times [2021-08-26 14:32:12,134 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:12,134 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465718482] [2021-08-26 14:32:12,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:12,135 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:12,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:32:12,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:32:12,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:32:12,351 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1465718482] [2021-08-26 14:32:12,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1465718482] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:32:12,351 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:32:12,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:32:12,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143994130] [2021-08-26 14:32:12,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:32:12,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:32:12,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:32:12,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:32:12,353 INFO L87 Difference]: Start difference. First operand 112 states and 233 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:12,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:32:12,514 INFO L93 Difference]: Finished difference Result 127 states and 256 transitions. [2021-08-26 14:32:12,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:32:12,514 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2021-08-26 14:32:12,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:32:12,515 INFO L225 Difference]: With dead ends: 127 [2021-08-26 14:32:12,515 INFO L226 Difference]: Without dead ends: 66 [2021-08-26 14:32:12,515 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 131.0ms TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-08-26 14:32:12,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2021-08-26 14:32:12,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2021-08-26 14:32:12,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.7692307692307692) internal successors, (115), 65 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:12,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 115 transitions. [2021-08-26 14:32:12,517 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 115 transitions. Word has length 23 [2021-08-26 14:32:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:32:12,517 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 115 transitions. [2021-08-26 14:32:12,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 7 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:32:12,517 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 115 transitions. [2021-08-26 14:32:12,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-08-26 14:32:12,518 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:32:12,518 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:32:12,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:32:12,518 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-26 14:32:12,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:32:12,518 INFO L82 PathProgramCache]: Analyzing trace with hash -669474307, now seen corresponding path program 5 times [2021-08-26 14:32:12,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:32:12,519 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193546126] [2021-08-26 14:32:12,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:32:12,519 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:32:12,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:32:12,563 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 14:32:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:32:12,656 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 14:32:12,657 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 14:32:12,657 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:32:12,659 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:32:12,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:32:12,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:32:12,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-26 14:32:12,660 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:32:12,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:32:12,666 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:32:12,666 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:32:12,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:32:12 BasicIcfg [2021-08-26 14:32:12,731 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:32:12,732 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:32:12,732 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:32:12,732 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:32:12,733 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:32:03" (3/4) ... [2021-08-26 14:32:12,734 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 14:32:12,808 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:32:12,808 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:32:12,811 INFO L168 Benchmark]: Toolchain (without parser) took 11709.51 ms. Allocated memory was 71.3 MB in the beginning and 249.6 MB in the end (delta: 178.3 MB). Free memory was 54.8 MB in the beginning and 179.4 MB in the end (delta: -124.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,812 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 71.3 MB. Free memory was 54.1 MB in the beginning and 54.0 MB in the end (delta: 58.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:32:12,813 INFO L168 Benchmark]: CACSL2BoogieTranslator took 530.96 ms. Allocated memory is still 71.3 MB. Free memory was 54.6 MB in the beginning and 42.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,813 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.42 ms. Allocated memory is still 71.3 MB. Free memory was 42.1 MB in the beginning and 39.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,813 INFO L168 Benchmark]: Boogie Preprocessor took 58.14 ms. Allocated memory is still 71.3 MB. Free memory was 39.6 MB in the beginning and 37.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,814 INFO L168 Benchmark]: RCFGBuilder took 1781.20 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 37.3 MB in the beginning and 41.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,814 INFO L168 Benchmark]: TraceAbstraction took 9178.54 ms. Allocated memory was 86.0 MB in the beginning and 249.6 MB in the end (delta: 163.6 MB). Free memory was 40.4 MB in the beginning and 197.3 MB in the end (delta: -156.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,814 INFO L168 Benchmark]: Witness Printer took 76.59 ms. Allocated memory is still 249.6 MB. Free memory was 197.3 MB in the beginning and 179.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:32:12,816 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.20 ms. Allocated memory is still 71.3 MB. Free memory was 54.1 MB in the beginning and 54.0 MB in the end (delta: 58.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 530.96 ms. Allocated memory is still 71.3 MB. Free memory was 54.6 MB in the beginning and 42.3 MB in the end (delta: 12.4 MB). Peak memory consumption was 11.1 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 76.42 ms. Allocated memory is still 71.3 MB. Free memory was 42.1 MB in the beginning and 39.7 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 58.14 ms. Allocated memory is still 71.3 MB. Free memory was 39.6 MB in the beginning and 37.5 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1781.20 ms. Allocated memory was 71.3 MB in the beginning and 86.0 MB in the end (delta: 14.7 MB). Free memory was 37.3 MB in the beginning and 41.1 MB in the end (delta: -3.8 MB). Peak memory consumption was 25.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9178.54 ms. Allocated memory was 86.0 MB in the beginning and 249.6 MB in the end (delta: 163.6 MB). Free memory was 40.4 MB in the beginning and 197.3 MB in the end (delta: -156.9 MB). Peak memory consumption was 127.9 MB. Max. memory is 16.1 GB. * Witness Printer took 76.59 ms. Allocated memory is still 249.6 MB. Free memory was 197.3 MB in the beginning and 179.4 MB in the end (delta: 17.8 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6077.9ms, 118 PlacesBefore, 38 PlacesAfterwards, 110 TransitionsBefore, 29 TransitionsAfterwards, 2048 CoEnabledTransitionPairs, 7 FixpointIterations, 39 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 92 TotalNumberOfCompositions, 5725 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2587, positive: 2401, positive conditional: 0, positive unconditional: 2401, negative: 186, negative conditional: 0, negative unconditional: 186, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1364, positive: 1318, positive conditional: 0, positive unconditional: 1318, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1364, positive: 1304, positive conditional: 0, positive unconditional: 1304, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 46, negative conditional: 0, negative unconditional: 46, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, positive: 17, positive conditional: 0, positive unconditional: 17, negative: 321, negative conditional: 0, negative unconditional: 321, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2587, positive: 1083, positive conditional: 0, positive unconditional: 1083, negative: 140, negative conditional: 0, negative unconditional: 140, unknown: 1364, unknown conditional: 0, unknown unconditional: 1364] , Statistics on independence cache: Total cache size (in pairs): 151, Positive cache size: 126, Positive conditional cache size: 0, Positive unconditional cache size: 126, Negative cache size: 25, Negative conditional cache size: 0, Negative unconditional cache size: 25 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L713] 0 int __unbuffered_p2_EBX = 0; [L715] 0 int a = 0; [L716] 0 _Bool a$flush_delayed; [L717] 0 int a$mem_tmp; [L718] 0 _Bool a$r_buff0_thd0; [L719] 0 _Bool a$r_buff0_thd1; [L720] 0 _Bool a$r_buff0_thd2; [L721] 0 _Bool a$r_buff0_thd3; [L722] 0 _Bool a$r_buff1_thd0; [L723] 0 _Bool a$r_buff1_thd1; [L724] 0 _Bool a$r_buff1_thd2; [L725] 0 _Bool a$r_buff1_thd3; [L726] 0 _Bool a$read_delayed; [L727] 0 int *a$read_delayed_var; [L728] 0 int a$w_buff0; [L729] 0 _Bool a$w_buff0_used; [L730] 0 int a$w_buff1; [L731] 0 _Bool a$w_buff1_used; [L732] 0 _Bool main$tmp_guard0; [L733] 0 _Bool main$tmp_guard1; [L735] 0 int x = 0; [L737] 0 int y = 0; [L739] 0 int z = 0; [L740] 0 _Bool weak$$choice0; [L741] 0 _Bool weak$$choice2; [L841] 0 pthread_t t1199; [L842] FCALL, FORK 0 pthread_create(&t1199, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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] [L843] 0 pthread_t t1200; [L844] FCALL, FORK 0 pthread_create(&t1200, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L845] 0 pthread_t t1201; [L846] FCALL, FORK 0 pthread_create(&t1201, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L745] 1 a$w_buff1 = a$w_buff0 [L746] 1 a$w_buff0 = 1 [L747] 1 a$w_buff1_used = a$w_buff0_used [L748] 1 a$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L750] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L751] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L752] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L753] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L754] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y=0, z=0] [L757] 1 x = 1 VAL [__unbuffered_cnt=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] [L774] 2 x = 2 VAL [__unbuffered_cnt=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=2, y=0, z=0] [L777] 2 y = 1 VAL [__unbuffered_cnt=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=2, y=1, z=0] [L794] 3 y = 2 [L797] 3 z = 1 VAL [__unbuffered_cnt=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=2, y=2, z=1] [L780] 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) [L780] EXPR 2 a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a [L780] 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) [L780] 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) [L781] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L781] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L782] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L782] 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 [L783] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L783] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L784] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 [L784] 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 [L787] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L789] 2 return 0; [L800] 3 __unbuffered_p2_EAX = z VAL [\result={0:0}, __unbuffered_cnt=1, __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=2, y=2, z=1] [L803] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L804] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L805] 3 a$flush_delayed = weak$$choice2 [L806] 3 a$mem_tmp = a [L807] 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) [L807] 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) [L808] 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)) [L808] 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)) [L809] 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)) [L809] 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)) [L810] 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)) [L810] 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)) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 3 __unbuffered_p2_EBX = a [L815] EXPR 3 a$flush_delayed ? a$mem_tmp : a [L815] 3 a = a$flush_delayed ? a$mem_tmp : a [L816] 3 a$flush_delayed = (_Bool)0 VAL [\result={0:0}, __unbuffered_cnt=1, __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=255, x=2, y=2, z=1] [L760] 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) [L760] 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) [L761] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L761] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L762] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L762] 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 [L763] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L763] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L764] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 [L764] 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 [L819] 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) [L819] EXPR 3 a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a [L819] 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) [L819] 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) [L820] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L820] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L821] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L821] 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 [L822] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L822] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L823] EXPR 3 a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 [L823] 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 [L826] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L828] 3 return 0; [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 1 return 0; [L848] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L3] COND FALSE 0 !(!cond) [L852] 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) [L852] EXPR 0 a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a [L852] 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) [L852] 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) [L853] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L853] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L854] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L854] 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 [L855] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L855] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L856] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 [L856] 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 [L859] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __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_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=255, x=2, y=2, 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: 842]: 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: 846]: 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: 844]: 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, 139 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8963.5ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 19.0ms, AutomataDifference: 892.4ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6155.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 358 SDtfs, 392 SDslu, 698 SDs, 0 SdLazy, 271 SolverSat, 70 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 390.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 417.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=1034occurred in iteration=0, InterpolantAutomatonStates: 64, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 224.0ms AutomataMinimizationTime, 11 MinimizatonAttempts, 561 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 37.9ms SsaConstructionTime, 482.6ms SatisfiabilityAnalysisTime, 850.6ms InterpolantComputationTime, 199 NumberOfCodeBlocks, 199 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 165 ConstructedInterpolants, 0 QuantifiedInterpolants, 1015 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 14:32:12,863 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...