./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e19ca921 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.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 b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-e19ca92 [2021-12-22 13:32:02,118 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-22 13:32:02,120 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-22 13:32:02,149 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-22 13:32:02,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-22 13:32:02,154 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-22 13:32:02,156 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-22 13:32:02,161 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-22 13:32:02,162 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-22 13:32:02,167 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-22 13:32:02,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-22 13:32:02,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-22 13:32:02,168 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-22 13:32:02,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-22 13:32:02,171 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-22 13:32:02,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-22 13:32:02,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-22 13:32:02,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-22 13:32:02,178 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-22 13:32:02,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-22 13:32:02,183 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-22 13:32:02,185 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-22 13:32:02,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-22 13:32:02,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-22 13:32:02,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-22 13:32:02,191 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-22 13:32:02,191 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-22 13:32:02,192 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-22 13:32:02,192 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-22 13:32:02,193 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-22 13:32:02,194 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-22 13:32:02,194 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-22 13:32:02,195 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-22 13:32:02,196 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-22 13:32:02,197 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-22 13:32:02,197 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-22 13:32:02,197 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-22 13:32:02,198 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-22 13:32:02,198 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-22 13:32:02,198 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-22 13:32:02,199 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-22 13:32:02,199 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-22 13:32:02,225 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-22 13:32:02,225 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-22 13:32:02,225 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-22 13:32:02,226 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-22 13:32:02,226 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-22 13:32:02,227 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-22 13:32:02,227 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-22 13:32:02,227 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-22 13:32:02,227 INFO L138 SettingsManager]: * Use SBE=true [2021-12-22 13:32:02,227 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-22 13:32:02,228 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-22 13:32:02,228 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-22 13:32:02,228 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-22 13:32:02,229 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-22 13:32:02,229 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-22 13:32:02,229 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-22 13:32:02,229 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-22 13:32:02,229 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-22 13:32:02,229 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-22 13:32:02,230 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-22 13:32:02,230 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-22 13:32:02,230 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-22 13:32:02,230 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-22 13:32:02,230 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-22 13:32:02,230 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:32:02,231 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-22 13:32:02,231 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-22 13:32:02,231 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-22 13:32:02,231 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-22 13:32:02,231 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-22 13:32:02,231 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-22 13:32:02,231 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-22 13:32:02,232 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-22 13:32:02,232 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-22 13:32:02,232 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 -> b046eb92ec2f4af5c767436762d7e86376926c2222092f8f03ea795d781fd943 [2021-12-22 13:32:02,453 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-22 13:32:02,474 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-22 13:32:02,476 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-22 13:32:02,477 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-22 13:32:02,478 INFO L275 PluginConnector]: CDTParser initialized [2021-12-22 13:32:02,479 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-22 13:32:02,553 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18cb221b/a8b28245c1984df9962a1828888d6268/FLAG153e5b98a [2021-12-22 13:32:02,893 INFO L306 CDTParser]: Found 1 translation units. [2021-12-22 13:32:02,894 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-22 13:32:02,903 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18cb221b/a8b28245c1984df9962a1828888d6268/FLAG153e5b98a [2021-12-22 13:32:03,295 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e18cb221b/a8b28245c1984df9962a1828888d6268 [2021-12-22 13:32:03,298 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-22 13:32:03,299 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-22 13:32:03,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-22 13:32:03,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-22 13:32:03,303 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-22 13:32:03,304 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,305 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15354bf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03, skipping insertion in model container [2021-12-22 13:32:03,305 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,310 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-22 13:32:03,353 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-22 13:32:03,511 WARN L230 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2021-12-22 13:32:03,689 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:32:03,695 INFO L203 MainTranslator]: Completed pre-run [2021-12-22 13:32:03,704 WARN L230 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/safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i[996,1009] [2021-12-22 13:32:03,736 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-22 13:32:03,762 INFO L208 MainTranslator]: Completed translation [2021-12-22 13:32:03,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03 WrapperNode [2021-12-22 13:32:03,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-22 13:32:03,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-22 13:32:03,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-22 13:32:03,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-22 13:32:03,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,801 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,830 INFO L137 Inliner]: procedures = 176, calls = 52, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 273 [2021-12-22 13:32:03,831 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-22 13:32:03,831 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-22 13:32:03,831 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-22 13:32:03,832 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-22 13:32:03,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,842 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,845 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,846 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,851 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,854 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,856 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,859 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-22 13:32:03,860 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-22 13:32:03,860 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-22 13:32:03,860 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-22 13:32:03,861 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (1/1) ... [2021-12-22 13:32:03,868 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-22 13:32:03,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-22 13:32:03,887 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-12-22 13:32:03,907 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-12-22 13:32:03,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-22 13:32:03,928 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-12-22 13:32:03,928 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-22 13:32:03,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-22 13:32:03,929 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-22 13:32:03,929 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-12-22 13:32:03,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-12-22 13:32:03,929 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-12-22 13:32:03,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-12-22 13:32:03,929 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-12-22 13:32:03,929 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-12-22 13:32:03,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-22 13:32:03,930 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-12-22 13:32:03,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-22 13:32:03,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-22 13:32:03,931 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-12-22 13:32:04,019 INFO L234 CfgBuilder]: Building ICFG [2021-12-22 13:32:04,021 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-22 13:32:04,437 INFO L275 CfgBuilder]: Performing block encoding [2021-12-22 13:32:04,630 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-22 13:32:04,631 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-22 13:32:04,633 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:04 BoogieIcfgContainer [2021-12-22 13:32:04,633 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-22 13:32:04,634 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-22 13:32:04,634 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-22 13:32:04,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-22 13:32:04,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.12 01:32:03" (1/3) ... [2021-12-22 13:32:04,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94a46fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:32:04, skipping insertion in model container [2021-12-22 13:32:04,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.12 01:32:03" (2/3) ... [2021-12-22 13:32:04,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@94a46fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.12 01:32:04, skipping insertion in model container [2021-12-22 13:32:04,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:04" (3/3) ... [2021-12-22 13:32:04,640 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_power.oepc_power.opt_pso.oepc_pso.opt_rmo.oepc_rmo.opt.i [2021-12-22 13:32:04,645 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-12-22 13:32:04,645 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-22 13:32:04,646 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-12-22 13:32:04,646 INFO L513 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-12-22 13:32:04,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,678 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,679 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,680 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,681 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,681 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,681 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,682 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,683 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,684 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,685 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,686 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,687 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,687 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,687 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,687 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,688 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,689 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,690 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,691 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,692 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,693 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,693 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,694 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,695 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,695 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,696 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,697 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,697 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,698 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,699 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,700 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,702 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,702 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,703 WARN L322 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,703 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,704 WARN L322 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,704 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_~expression#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,705 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4#1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,706 WARN L322 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_~arg#1.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,706 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,706 WARN L322 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,707 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,708 WARN L322 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-12-22 13:32:04,708 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-12-22 13:32:04,760 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-22 13:32:04,764 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, mAutomataTypeConcurrency=PETRI_NET, 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-12-22 13:32:04,764 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-12-22 13:32:04,772 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 120 places, 112 transitions, 239 flow [2021-12-22 13:32:04,797 INFO L129 PetriNetUnfolder]: 2/109 cut-off events. [2021-12-22 13:32:04,797 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:32:04,800 INFO L84 FinitePrefix]: Finished finitePrefix Result has 119 conditions, 109 events. 2/109 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 48 event pairs, 0 based on Foata normal form. 0/105 useless extension candidates. Maximal degree in co-relation 72. Up to 2 conditions per place. [2021-12-22 13:32:04,800 INFO L82 GeneralOperation]: Start removeDead. Operand has 120 places, 112 transitions, 239 flow [2021-12-22 13:32:04,803 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 117 places, 109 transitions, 227 flow [2021-12-22 13:32:04,808 INFO L129 PetriNetUnfolder]: 0/43 cut-off events. [2021-12-22 13:32:04,808 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-12-22 13:32:04,809 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:04,809 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:04,810 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:04,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:04,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1234575711, now seen corresponding path program 1 times [2021-12-22 13:32:04,819 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:04,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119333495] [2021-12-22 13:32:04,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:04,820 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:04,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:04,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:04,974 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:04,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119333495] [2021-12-22 13:32:04,975 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119333495] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:04,975 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:04,975 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-22 13:32:04,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480121710] [2021-12-22 13:32:04,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:04,982 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-12-22 13:32:04,983 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:04,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-22 13:32:05,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-22 13:32:05,001 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 112 [2021-12-22 13:32:05,004 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 109 transitions, 227 flow. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-12-22 13:32:05,005 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:05,005 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 112 [2021-12-22 13:32:05,006 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:05,115 INFO L129 PetriNetUnfolder]: 58/484 cut-off events. [2021-12-22 13:32:05,115 INFO L130 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2021-12-22 13:32:05,118 INFO L84 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 484 events. 58/484 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 2505 event pairs, 44 based on Foata normal form. 15/466 useless extension candidates. Maximal degree in co-relation 563. Up to 79 conditions per place. [2021-12-22 13:32:05,120 INFO L132 encePairwiseOnDemand]: 107/112 looper letters, 14 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2021-12-22 13:32:05,120 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 269 flow [2021-12-22 13:32:05,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-22 13:32:05,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2021-12-22 13:32:05,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 315 transitions. [2021-12-22 13:32:05,130 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9375 [2021-12-22 13:32:05,131 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 315 transitions. [2021-12-22 13:32:05,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 315 transitions. [2021-12-22 13:32:05,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:05,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 315 transitions. [2021-12-22 13:32:05,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 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-12-22 13:32:05,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-12-22 13:32:05,140 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 112.0) internal successors, (448), 4 states have internal predecessors, (448), 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-12-22 13:32:05,142 INFO L186 Difference]: Start difference. First operand has 117 places, 109 transitions, 227 flow. Second operand 3 states and 315 transitions. [2021-12-22 13:32:05,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 269 flow [2021-12-22 13:32:05,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 111 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2021-12-22 13:32:05,147 INFO L242 Difference]: Finished difference. Result has 114 places, 105 transitions, 220 flow [2021-12-22 13:32:05,148 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=114, PETRI_TRANSITIONS=105} [2021-12-22 13:32:05,151 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, -3 predicate places. [2021-12-22 13:32:05,151 INFO L470 AbstractCegarLoop]: Abstraction has has 114 places, 105 transitions, 220 flow [2021-12-22 13:32:05,151 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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-12-22 13:32:05,151 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:05,152 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:05,152 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-22 13:32:05,152 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:05,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1218056957, now seen corresponding path program 1 times [2021-12-22 13:32:05,153 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:05,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104280142] [2021-12-22 13:32:05,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:05,153 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:05,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:05,325 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:05,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104280142] [2021-12-22 13:32:05,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104280142] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:05,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:05,326 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:05,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339923489] [2021-12-22 13:32:05,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:05,327 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:05,327 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:05,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:05,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:05,328 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:05,329 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 105 transitions, 220 flow. Second operand has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-12-22 13:32:05,329 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:05,329 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:05,329 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:05,744 INFO L129 PetriNetUnfolder]: 834/2274 cut-off events. [2021-12-22 13:32:05,745 INFO L130 PetriNetUnfolder]: For 103/103 co-relation queries the response was YES. [2021-12-22 13:32:05,750 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3699 conditions, 2274 events. 834/2274 cut-off events. For 103/103 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 17180 event pairs, 193 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 3649. Up to 732 conditions per place. [2021-12-22 13:32:05,757 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 23 selfloop transitions, 3 changer transitions 57/158 dead transitions. [2021-12-22 13:32:05,757 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 158 transitions, 488 flow [2021-12-22 13:32:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:05,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:05,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 875 transitions. [2021-12-22 13:32:05,761 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2021-12-22 13:32:05,762 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 875 transitions. [2021-12-22 13:32:05,762 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 875 transitions. [2021-12-22 13:32:05,762 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:05,762 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 875 transitions. [2021-12-22 13:32:05,764 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 97.22222222222223) internal successors, (875), 9 states have internal predecessors, (875), 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-12-22 13:32:05,767 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-12-22 13:32:05,767 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-12-22 13:32:05,768 INFO L186 Difference]: Start difference. First operand has 114 places, 105 transitions, 220 flow. Second operand 9 states and 875 transitions. [2021-12-22 13:32:05,768 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 158 transitions, 488 flow [2021-12-22 13:32:05,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 158 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2021-12-22 13:32:05,771 INFO L242 Difference]: Finished difference. Result has 127 places, 95 transitions, 235 flow [2021-12-22 13:32:05,771 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=235, PETRI_PLACES=127, PETRI_TRANSITIONS=95} [2021-12-22 13:32:05,772 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 10 predicate places. [2021-12-22 13:32:05,772 INFO L470 AbstractCegarLoop]: Abstraction has has 127 places, 95 transitions, 235 flow [2021-12-22 13:32:05,773 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.83333333333333) internal successors, (545), 6 states have internal predecessors, (545), 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-12-22 13:32:05,773 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:05,773 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:05,773 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-22 13:32:05,773 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:05,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2123130946, now seen corresponding path program 1 times [2021-12-22 13:32:05,774 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:05,775 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847642225] [2021-12-22 13:32:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:05,775 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:05,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:05,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:05,892 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:05,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847642225] [2021-12-22 13:32:05,893 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847642225] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:05,893 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:05,893 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:05,893 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104025113] [2021-12-22 13:32:05,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:05,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:05,894 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:05,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:05,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:05,895 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 112 [2021-12-22 13:32:05,896 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 95 transitions, 235 flow. Second operand has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-12-22 13:32:05,896 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:05,896 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 112 [2021-12-22 13:32:05,897 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:06,190 INFO L129 PetriNetUnfolder]: 424/955 cut-off events. [2021-12-22 13:32:06,190 INFO L130 PetriNetUnfolder]: For 715/722 co-relation queries the response was YES. [2021-12-22 13:32:06,193 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2176 conditions, 955 events. 424/955 cut-off events. For 715/722 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 5310 event pairs, 100 based on Foata normal form. 30/937 useless extension candidates. Maximal degree in co-relation 2119. Up to 295 conditions per place. [2021-12-22 13:32:06,197 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 18 selfloop transitions, 2 changer transitions 31/130 dead transitions. [2021-12-22 13:32:06,197 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 130 transitions, 425 flow [2021-12-22 13:32:06,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:06,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 872 transitions. [2021-12-22 13:32:06,199 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8650793650793651 [2021-12-22 13:32:06,200 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 872 transitions. [2021-12-22 13:32:06,200 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 872 transitions. [2021-12-22 13:32:06,200 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:06,200 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 872 transitions. [2021-12-22 13:32:06,202 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 96.88888888888889) internal successors, (872), 9 states have internal predecessors, (872), 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-12-22 13:32:06,203 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-12-22 13:32:06,204 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-12-22 13:32:06,204 INFO L186 Difference]: Start difference. First operand has 127 places, 95 transitions, 235 flow. Second operand 9 states and 872 transitions. [2021-12-22 13:32:06,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 130 transitions, 425 flow [2021-12-22 13:32:06,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 130 transitions, 408 flow, removed 7 selfloop flow, removed 4 redundant places. [2021-12-22 13:32:06,210 INFO L242 Difference]: Finished difference. Result has 120 places, 95 transitions, 246 flow [2021-12-22 13:32:06,210 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=246, PETRI_PLACES=120, PETRI_TRANSITIONS=95} [2021-12-22 13:32:06,211 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 3 predicate places. [2021-12-22 13:32:06,211 INFO L470 AbstractCegarLoop]: Abstraction has has 120 places, 95 transitions, 246 flow [2021-12-22 13:32:06,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.83333333333333) internal successors, (557), 6 states have internal predecessors, (557), 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-12-22 13:32:06,211 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:06,211 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:06,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-22 13:32:06,212 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:06,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1885111197, now seen corresponding path program 1 times [2021-12-22 13:32:06,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:06,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169009402] [2021-12-22 13:32:06,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:06,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:06,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-12-22 13:32:06,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:06,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169009402] [2021-12-22 13:32:06,369 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169009402] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:06,369 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:06,369 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-12-22 13:32:06,369 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974628345] [2021-12-22 13:32:06,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:06,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-22 13:32:06,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:06,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-22 13:32:06,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-12-22 13:32:06,372 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:06,372 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 95 transitions, 246 flow. Second operand has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 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-12-22 13:32:06,373 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:06,373 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:06,373 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:06,830 INFO L129 PetriNetUnfolder]: 437/1039 cut-off events. [2021-12-22 13:32:06,830 INFO L130 PetriNetUnfolder]: For 1241/1252 co-relation queries the response was YES. [2021-12-22 13:32:06,834 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1039 events. 437/1039 cut-off events. For 1241/1252 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 5851 event pairs, 137 based on Foata normal form. 30/1015 useless extension candidates. Maximal degree in co-relation 2432. Up to 399 conditions per place. [2021-12-22 13:32:06,838 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 21 selfloop transitions, 10 changer transitions 44/151 dead transitions. [2021-12-22 13:32:06,838 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 151 transitions, 560 flow [2021-12-22 13:32:06,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-12-22 13:32:06,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2021-12-22 13:32:06,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 1398 transitions. [2021-12-22 13:32:06,841 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8321428571428572 [2021-12-22 13:32:06,841 INFO L72 ComplementDD]: Start complementDD. Operand 15 states and 1398 transitions. [2021-12-22 13:32:06,841 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 1398 transitions. [2021-12-22 13:32:06,842 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:06,842 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 15 states and 1398 transitions. [2021-12-22 13:32:06,844 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 16 states, 15 states have (on average 93.2) internal successors, (1398), 15 states have internal predecessors, (1398), 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-12-22 13:32:06,846 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 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-12-22 13:32:06,846 INFO L81 ComplementDD]: Finished complementDD. Result has 16 states, 16 states have (on average 112.0) internal successors, (1792), 16 states have internal predecessors, (1792), 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-12-22 13:32:06,847 INFO L186 Difference]: Start difference. First operand has 120 places, 95 transitions, 246 flow. Second operand 15 states and 1398 transitions. [2021-12-22 13:32:06,847 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 151 transitions, 560 flow [2021-12-22 13:32:06,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 151 transitions, 520 flow, removed 18 selfloop flow, removed 8 redundant places. [2021-12-22 13:32:06,853 INFO L242 Difference]: Finished difference. Result has 131 places, 101 transitions, 314 flow [2021-12-22 13:32:06,853 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=314, PETRI_PLACES=131, PETRI_TRANSITIONS=101} [2021-12-22 13:32:06,854 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 14 predicate places. [2021-12-22 13:32:06,854 INFO L470 AbstractCegarLoop]: Abstraction has has 131 places, 101 transitions, 314 flow [2021-12-22 13:32:06,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.4) internal successors, (894), 10 states have internal predecessors, (894), 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-12-22 13:32:06,855 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:06,855 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:06,855 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-22 13:32:06,855 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:06,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:06,856 INFO L85 PathProgramCache]: Analyzing trace with hash -245895852, now seen corresponding path program 1 times [2021-12-22 13:32:06,856 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:06,856 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699943945] [2021-12-22 13:32:06,856 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:06,857 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:06,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:07,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:07,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699943945] [2021-12-22 13:32:07,151 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699943945] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:07,151 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:07,151 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:32:07,151 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999931031] [2021-12-22 13:32:07,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:07,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:32:07,152 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:07,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:32:07,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:32:07,154 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 112 [2021-12-22 13:32:07,155 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 101 transitions, 314 flow. Second operand has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 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-12-22 13:32:07,155 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:07,155 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 112 [2021-12-22 13:32:07,155 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:07,498 INFO L129 PetriNetUnfolder]: 337/825 cut-off events. [2021-12-22 13:32:07,498 INFO L130 PetriNetUnfolder]: For 2305/2319 co-relation queries the response was YES. [2021-12-22 13:32:07,502 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2715 conditions, 825 events. 337/825 cut-off events. For 2305/2319 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4371 event pairs, 117 based on Foata normal form. 23/813 useless extension candidates. Maximal degree in co-relation 2638. Up to 400 conditions per place. [2021-12-22 13:32:07,506 INFO L132 encePairwiseOnDemand]: 97/112 looper letters, 22 selfloop transitions, 16 changer transitions 35/146 dead transitions. [2021-12-22 13:32:07,506 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 146 transitions, 756 flow [2021-12-22 13:32:07,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2021-12-22 13:32:07,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2021-12-22 13:32:07,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 1602 transitions. [2021-12-22 13:32:07,510 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7946428571428571 [2021-12-22 13:32:07,510 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 1602 transitions. [2021-12-22 13:32:07,510 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 1602 transitions. [2021-12-22 13:32:07,511 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:07,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 1602 transitions. [2021-12-22 13:32:07,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 89.0) internal successors, (1602), 18 states have internal predecessors, (1602), 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-12-22 13:32:07,516 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 112.0) internal successors, (2128), 19 states have internal predecessors, (2128), 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-12-22 13:32:07,517 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 112.0) internal successors, (2128), 19 states have internal predecessors, (2128), 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-12-22 13:32:07,518 INFO L186 Difference]: Start difference. First operand has 131 places, 101 transitions, 314 flow. Second operand 18 states and 1602 transitions. [2021-12-22 13:32:07,518 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 146 transitions, 756 flow [2021-12-22 13:32:07,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 146 transitions, 734 flow, removed 9 selfloop flow, removed 5 redundant places. [2021-12-22 13:32:07,525 INFO L242 Difference]: Finished difference. Result has 145 places, 105 transitions, 418 flow [2021-12-22 13:32:07,525 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=418, PETRI_PLACES=145, PETRI_TRANSITIONS=105} [2021-12-22 13:32:07,527 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 28 predicate places. [2021-12-22 13:32:07,528 INFO L470 AbstractCegarLoop]: Abstraction has has 145 places, 105 transitions, 418 flow [2021-12-22 13:32:07,528 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 86.28571428571429) internal successors, (1208), 14 states have internal predecessors, (1208), 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-12-22 13:32:07,528 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:07,529 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:07,529 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-22 13:32:07,529 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:07,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:07,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1801427826, now seen corresponding path program 1 times [2021-12-22 13:32:07,530 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:07,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155110352] [2021-12-22 13:32:07,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:07,530 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:07,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:07,692 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:07,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155110352] [2021-12-22 13:32:07,692 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155110352] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:07,693 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:07,693 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:32:07,693 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812306260] [2021-12-22 13:32:07,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:07,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:32:07,694 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:07,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:32:07,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:32:07,695 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:07,696 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 105 transitions, 418 flow. Second operand has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 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-12-22 13:32:07,696 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:07,696 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:07,696 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:08,011 INFO L129 PetriNetUnfolder]: 674/1431 cut-off events. [2021-12-22 13:32:08,011 INFO L130 PetriNetUnfolder]: For 9181/9191 co-relation queries the response was YES. [2021-12-22 13:32:08,018 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5944 conditions, 1431 events. 674/1431 cut-off events. For 9181/9191 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 8522 event pairs, 105 based on Foata normal form. 35/1384 useless extension candidates. Maximal degree in co-relation 5857. Up to 514 conditions per place. [2021-12-22 13:32:08,024 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 37 selfloop transitions, 5 changer transitions 27/147 dead transitions. [2021-12-22 13:32:08,025 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 147 transitions, 951 flow [2021-12-22 13:32:08,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-22 13:32:08,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2021-12-22 13:32:08,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 673 transitions. [2021-12-22 13:32:08,027 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8584183673469388 [2021-12-22 13:32:08,027 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 673 transitions. [2021-12-22 13:32:08,027 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 673 transitions. [2021-12-22 13:32:08,027 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:08,027 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 673 transitions. [2021-12-22 13:32:08,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 96.14285714285714) internal successors, (673), 7 states have internal predecessors, (673), 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-12-22 13:32:08,029 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 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-12-22 13:32:08,030 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 112.0) internal successors, (896), 8 states have internal predecessors, (896), 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-12-22 13:32:08,030 INFO L186 Difference]: Start difference. First operand has 145 places, 105 transitions, 418 flow. Second operand 7 states and 673 transitions. [2021-12-22 13:32:08,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 147 transitions, 951 flow [2021-12-22 13:32:08,042 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 147 transitions, 807 flow, removed 67 selfloop flow, removed 14 redundant places. [2021-12-22 13:32:08,043 INFO L242 Difference]: Finished difference. Result has 132 places, 105 transitions, 385 flow [2021-12-22 13:32:08,044 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=362, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=385, PETRI_PLACES=132, PETRI_TRANSITIONS=105} [2021-12-22 13:32:08,044 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2021-12-22 13:32:08,044 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 105 transitions, 385 flow [2021-12-22 13:32:08,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.0) internal successors, (630), 7 states have internal predecessors, (630), 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-12-22 13:32:08,045 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:08,045 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:08,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-22 13:32:08,045 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:08,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:08,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1964555488, now seen corresponding path program 2 times [2021-12-22 13:32:08,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:08,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469617121] [2021-12-22 13:32:08,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:08,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:08,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:08,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:08,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:08,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469617121] [2021-12-22 13:32:08,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469617121] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:08,161 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:08,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:32:08,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312313582] [2021-12-22 13:32:08,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:08,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:32:08,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:08,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:32:08,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:32:08,163 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:08,163 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 105 transitions, 385 flow. Second operand has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 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-12-22 13:32:08,164 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:08,164 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:08,164 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:08,492 INFO L129 PetriNetUnfolder]: 353/871 cut-off events. [2021-12-22 13:32:08,492 INFO L130 PetriNetUnfolder]: For 2940/2972 co-relation queries the response was YES. [2021-12-22 13:32:08,496 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3026 conditions, 871 events. 353/871 cut-off events. For 2940/2972 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4700 event pairs, 103 based on Foata normal form. 26/861 useless extension candidates. Maximal degree in co-relation 2944. Up to 339 conditions per place. [2021-12-22 13:32:08,500 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 32 selfloop transitions, 10 changer transitions 37/156 dead transitions. [2021-12-22 13:32:08,501 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 142 places, 156 transitions, 861 flow [2021-12-22 13:32:08,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:32:08,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:32:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1319 transitions. [2021-12-22 13:32:08,503 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8411989795918368 [2021-12-22 13:32:08,504 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1319 transitions. [2021-12-22 13:32:08,504 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1319 transitions. [2021-12-22 13:32:08,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:08,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1319 transitions. [2021-12-22 13:32:08,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 94.21428571428571) internal successors, (1319), 14 states have internal predecessors, (1319), 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-12-22 13:32:08,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-12-22 13:32:08,509 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-12-22 13:32:08,509 INFO L186 Difference]: Start difference. First operand has 132 places, 105 transitions, 385 flow. Second operand 14 states and 1319 transitions. [2021-12-22 13:32:08,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 142 places, 156 transitions, 861 flow [2021-12-22 13:32:08,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 156 transitions, 821 flow, removed 15 selfloop flow, removed 6 redundant places. [2021-12-22 13:32:08,515 INFO L242 Difference]: Finished difference. Result has 146 places, 108 transitions, 446 flow [2021-12-22 13:32:08,515 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=446, PETRI_PLACES=146, PETRI_TRANSITIONS=108} [2021-12-22 13:32:08,516 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 29 predicate places. [2021-12-22 13:32:08,516 INFO L470 AbstractCegarLoop]: Abstraction has has 146 places, 108 transitions, 446 flow [2021-12-22 13:32:08,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.75) internal successors, (726), 8 states have internal predecessors, (726), 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-12-22 13:32:08,517 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:08,517 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:08,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-22 13:32:08,517 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:08,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:08,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1870206367, now seen corresponding path program 1 times [2021-12-22 13:32:08,518 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:08,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166154674] [2021-12-22 13:32:08,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:08,518 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:08,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:08,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:08,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:08,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166154674] [2021-12-22 13:32:08,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166154674] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:08,583 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:08,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:08,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501584822] [2021-12-22 13:32:08,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:08,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:08,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:08,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:08,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:08,584 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 112 [2021-12-22 13:32:08,585 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 108 transitions, 446 flow. Second operand has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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-12-22 13:32:08,585 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:08,585 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 112 [2021-12-22 13:32:08,585 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:08,919 INFO L129 PetriNetUnfolder]: 573/1456 cut-off events. [2021-12-22 13:32:08,919 INFO L130 PetriNetUnfolder]: For 8217/8231 co-relation queries the response was YES. [2021-12-22 13:32:08,927 INFO L84 FinitePrefix]: Finished finitePrefix Result has 6214 conditions, 1456 events. 573/1456 cut-off events. For 8217/8231 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9342 event pairs, 155 based on Foata normal form. 26/1400 useless extension candidates. Maximal degree in co-relation 6128. Up to 409 conditions per place. [2021-12-22 13:32:08,933 INFO L132 encePairwiseOnDemand]: 106/112 looper letters, 37 selfloop transitions, 3 changer transitions 30/149 dead transitions. [2021-12-22 13:32:08,934 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 149 transitions, 988 flow [2021-12-22 13:32:08,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-12-22 13:32:08,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2021-12-22 13:32:08,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 861 transitions. [2021-12-22 13:32:08,936 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2021-12-22 13:32:08,936 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 861 transitions. [2021-12-22 13:32:08,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 861 transitions. [2021-12-22 13:32:08,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:08,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 861 transitions. [2021-12-22 13:32:08,938 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 95.66666666666667) internal successors, (861), 9 states have internal predecessors, (861), 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-12-22 13:32:08,939 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-12-22 13:32:08,939 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 112.0) internal successors, (1120), 10 states have internal predecessors, (1120), 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-12-22 13:32:08,939 INFO L186 Difference]: Start difference. First operand has 146 places, 108 transitions, 446 flow. Second operand 9 states and 861 transitions. [2021-12-22 13:32:08,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 149 transitions, 988 flow [2021-12-22 13:32:08,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 149 transitions, 921 flow, removed 30 selfloop flow, removed 8 redundant places. [2021-12-22 13:32:08,948 INFO L242 Difference]: Finished difference. Result has 144 places, 107 transitions, 429 flow [2021-12-22 13:32:08,949 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=413, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=429, PETRI_PLACES=144, PETRI_TRANSITIONS=107} [2021-12-22 13:32:08,949 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 27 predicate places. [2021-12-22 13:32:08,950 INFO L470 AbstractCegarLoop]: Abstraction has has 144 places, 107 transitions, 429 flow [2021-12-22 13:32:08,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.5) internal successors, (549), 6 states have internal predecessors, (549), 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-12-22 13:32:08,950 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:08,950 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:08,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-22 13:32:08,951 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:08,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:08,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1492497399, now seen corresponding path program 1 times [2021-12-22 13:32:08,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:08,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169355795] [2021-12-22 13:32:08,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:08,952 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:09,090 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:09,091 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:09,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169355795] [2021-12-22 13:32:09,091 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169355795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:09,091 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:09,092 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:32:09,092 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387056946] [2021-12-22 13:32:09,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:09,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:32:09,092 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:09,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:32:09,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:32:09,094 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-22 13:32:09,095 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 144 places, 107 transitions, 429 flow. Second operand has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 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-12-22 13:32:09,095 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:09,095 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-22 13:32:09,095 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:09,378 INFO L129 PetriNetUnfolder]: 329/909 cut-off events. [2021-12-22 13:32:09,378 INFO L130 PetriNetUnfolder]: For 5365/5395 co-relation queries the response was YES. [2021-12-22 13:32:09,383 INFO L84 FinitePrefix]: Finished finitePrefix Result has 3847 conditions, 909 events. 329/909 cut-off events. For 5365/5395 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5175 event pairs, 163 based on Foata normal form. 10/864 useless extension candidates. Maximal degree in co-relation 3757. Up to 441 conditions per place. [2021-12-22 13:32:09,387 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 33 selfloop transitions, 15 changer transitions 19/142 dead transitions. [2021-12-22 13:32:09,388 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 142 transitions, 899 flow [2021-12-22 13:32:09,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:32:09,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:32:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1187 transitions. [2021-12-22 13:32:09,391 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8152472527472527 [2021-12-22 13:32:09,391 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1187 transitions. [2021-12-22 13:32:09,391 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1187 transitions. [2021-12-22 13:32:09,391 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:09,391 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1187 transitions. [2021-12-22 13:32:09,393 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 91.3076923076923) internal successors, (1187), 13 states have internal predecessors, (1187), 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-12-22 13:32:09,395 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-12-22 13:32:09,395 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-12-22 13:32:09,395 INFO L186 Difference]: Start difference. First operand has 144 places, 107 transitions, 429 flow. Second operand 13 states and 1187 transitions. [2021-12-22 13:32:09,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 142 transitions, 899 flow [2021-12-22 13:32:09,401 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 142 transitions, 844 flow, removed 23 selfloop flow, removed 8 redundant places. [2021-12-22 13:32:09,402 INFO L242 Difference]: Finished difference. Result has 149 places, 112 transitions, 493 flow [2021-12-22 13:32:09,403 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=402, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=493, PETRI_PLACES=149, PETRI_TRANSITIONS=112} [2021-12-22 13:32:09,403 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 32 predicate places. [2021-12-22 13:32:09,403 INFO L470 AbstractCegarLoop]: Abstraction has has 149 places, 112 transitions, 493 flow [2021-12-22 13:32:09,404 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 88.54545454545455) internal successors, (974), 11 states have internal predecessors, (974), 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-12-22 13:32:09,404 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:09,404 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:09,404 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-22 13:32:09,405 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:09,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:09,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1645514146, now seen corresponding path program 1 times [2021-12-22 13:32:09,405 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:09,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777481291] [2021-12-22 13:32:09,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:09,406 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:09,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:09,613 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:09,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777481291] [2021-12-22 13:32:09,613 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777481291] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:09,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:09,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-12-22 13:32:09,613 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652900434] [2021-12-22 13:32:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:09,614 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2021-12-22 13:32:09,614 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:09,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-12-22 13:32:09,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-12-22 13:32:09,616 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 112 [2021-12-22 13:32:09,616 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 112 transitions, 493 flow. Second operand has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 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-12-22 13:32:09,616 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:09,617 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 112 [2021-12-22 13:32:09,617 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:10,129 INFO L129 PetriNetUnfolder]: 381/1015 cut-off events. [2021-12-22 13:32:10,130 INFO L130 PetriNetUnfolder]: For 6874/7153 co-relation queries the response was YES. [2021-12-22 13:32:10,135 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4621 conditions, 1015 events. 381/1015 cut-off events. For 6874/7153 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5984 event pairs, 172 based on Foata normal form. 25/969 useless extension candidates. Maximal degree in co-relation 4528. Up to 429 conditions per place. [2021-12-22 13:32:10,139 INFO L132 encePairwiseOnDemand]: 99/112 looper letters, 29 selfloop transitions, 14 changer transitions 42/160 dead transitions. [2021-12-22 13:32:10,139 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 160 transitions, 1188 flow [2021-12-22 13:32:10,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2021-12-22 13:32:10,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2021-12-22 13:32:10,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1553 transitions. [2021-12-22 13:32:10,142 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8156512605042017 [2021-12-22 13:32:10,143 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1553 transitions. [2021-12-22 13:32:10,143 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1553 transitions. [2021-12-22 13:32:10,143 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:10,143 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1553 transitions. [2021-12-22 13:32:10,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 91.3529411764706) internal successors, (1553), 17 states have internal predecessors, (1553), 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-12-22 13:32:10,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 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-12-22 13:32:10,148 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 112.0) internal successors, (2016), 18 states have internal predecessors, (2016), 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-12-22 13:32:10,148 INFO L186 Difference]: Start difference. First operand has 149 places, 112 transitions, 493 flow. Second operand 17 states and 1553 transitions. [2021-12-22 13:32:10,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 160 transitions, 1188 flow [2021-12-22 13:32:10,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 160 transitions, 1112 flow, removed 30 selfloop flow, removed 10 redundant places. [2021-12-22 13:32:10,158 INFO L242 Difference]: Finished difference. Result has 160 places, 113 transitions, 553 flow [2021-12-22 13:32:10,158 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=553, PETRI_PLACES=160, PETRI_TRANSITIONS=113} [2021-12-22 13:32:10,159 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 43 predicate places. [2021-12-22 13:32:10,159 INFO L470 AbstractCegarLoop]: Abstraction has has 160 places, 113 transitions, 553 flow [2021-12-22 13:32:10,159 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 88.41666666666667) internal successors, (1061), 12 states have internal predecessors, (1061), 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-12-22 13:32:10,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:10,160 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:10,160 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-22 13:32:10,160 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:10,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:10,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1321879912, now seen corresponding path program 1 times [2021-12-22 13:32:10,160 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:10,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438547002] [2021-12-22 13:32:10,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:10,161 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:10,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:10,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:10,323 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:10,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438547002] [2021-12-22 13:32:10,323 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438547002] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:10,324 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:10,324 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-12-22 13:32:10,324 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008073953] [2021-12-22 13:32:10,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:10,324 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-12-22 13:32:10,324 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:10,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-12-22 13:32:10,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2021-12-22 13:32:10,326 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 112 [2021-12-22 13:32:10,326 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 113 transitions, 553 flow. Second operand has 11 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 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-12-22 13:32:10,326 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:10,327 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 112 [2021-12-22 13:32:10,327 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:10,695 INFO L129 PetriNetUnfolder]: 300/858 cut-off events. [2021-12-22 13:32:10,695 INFO L130 PetriNetUnfolder]: For 10732/11053 co-relation queries the response was YES. [2021-12-22 13:32:10,700 INFO L84 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 858 events. 300/858 cut-off events. For 10732/11053 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5018 event pairs, 114 based on Foata normal form. 39/852 useless extension candidates. Maximal degree in co-relation 4782. Up to 395 conditions per place. [2021-12-22 13:32:10,705 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 33 selfloop transitions, 14 changer transitions 22/143 dead transitions. [2021-12-22 13:32:10,705 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 164 places, 143 transitions, 1033 flow [2021-12-22 13:32:10,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-12-22 13:32:10,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2021-12-22 13:32:10,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1261 transitions. [2021-12-22 13:32:10,707 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8042091836734694 [2021-12-22 13:32:10,707 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1261 transitions. [2021-12-22 13:32:10,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1261 transitions. [2021-12-22 13:32:10,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:10,708 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1261 transitions. [2021-12-22 13:32:10,711 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 90.07142857142857) internal successors, (1261), 14 states have internal predecessors, (1261), 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-12-22 13:32:10,712 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-12-22 13:32:10,713 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 112.0) internal successors, (1680), 15 states have internal predecessors, (1680), 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-12-22 13:32:10,713 INFO L186 Difference]: Start difference. First operand has 160 places, 113 transitions, 553 flow. Second operand 14 states and 1261 transitions. [2021-12-22 13:32:10,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 164 places, 143 transitions, 1033 flow [2021-12-22 13:32:10,726 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 143 transitions, 887 flow, removed 65 selfloop flow, removed 17 redundant places. [2021-12-22 13:32:10,729 INFO L242 Difference]: Finished difference. Result has 154 places, 115 transitions, 564 flow [2021-12-22 13:32:10,729 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=481, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=564, PETRI_PLACES=154, PETRI_TRANSITIONS=115} [2021-12-22 13:32:10,730 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2021-12-22 13:32:10,730 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 115 transitions, 564 flow [2021-12-22 13:32:10,730 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 87.63636363636364) internal successors, (964), 11 states have internal predecessors, (964), 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-12-22 13:32:10,730 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:10,730 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:10,730 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-22 13:32:10,731 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:10,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:10,731 INFO L85 PathProgramCache]: Analyzing trace with hash 1697787346, now seen corresponding path program 1 times [2021-12-22 13:32:10,731 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:10,731 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467579841] [2021-12-22 13:32:10,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:10,731 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:10,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:10,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:10,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:10,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467579841] [2021-12-22 13:32:10,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467579841] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:10,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:10,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-22 13:32:10,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190587845] [2021-12-22 13:32:10,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:10,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-22 13:32:10,884 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:10,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-22 13:32:10,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-12-22 13:32:10,885 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:10,886 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 115 transitions, 564 flow. Second operand has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 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-12-22 13:32:10,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:10,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:10,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:11,323 INFO L129 PetriNetUnfolder]: 352/1020 cut-off events. [2021-12-22 13:32:11,323 INFO L130 PetriNetUnfolder]: For 12322/12638 co-relation queries the response was YES. [2021-12-22 13:32:11,327 INFO L84 FinitePrefix]: Finished finitePrefix Result has 5806 conditions, 1020 events. 352/1020 cut-off events. For 12322/12638 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6291 event pairs, 62 based on Foata normal form. 31/984 useless extension candidates. Maximal degree in co-relation 5712. Up to 355 conditions per place. [2021-12-22 13:32:11,348 INFO L132 encePairwiseOnDemand]: 100/112 looper letters, 30 selfloop transitions, 23 changer transitions 27/156 dead transitions. [2021-12-22 13:32:11,348 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 156 transitions, 1329 flow [2021-12-22 13:32:11,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:32:11,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:32:11,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1208 transitions. [2021-12-22 13:32:11,350 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8296703296703297 [2021-12-22 13:32:11,350 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1208 transitions. [2021-12-22 13:32:11,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1208 transitions. [2021-12-22 13:32:11,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:11,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1208 transitions. [2021-12-22 13:32:11,351 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 92.92307692307692) internal successors, (1208), 13 states have internal predecessors, (1208), 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-12-22 13:32:11,353 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-12-22 13:32:11,353 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-12-22 13:32:11,353 INFO L186 Difference]: Start difference. First operand has 154 places, 115 transitions, 564 flow. Second operand 13 states and 1208 transitions. [2021-12-22 13:32:11,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 156 transitions, 1329 flow [2021-12-22 13:32:11,363 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 156 transitions, 1152 flow, removed 78 selfloop flow, removed 12 redundant places. [2021-12-22 13:32:11,380 INFO L242 Difference]: Finished difference. Result has 155 places, 120 transitions, 668 flow [2021-12-22 13:32:11,381 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=511, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=668, PETRI_PLACES=155, PETRI_TRANSITIONS=120} [2021-12-22 13:32:11,381 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 38 predicate places. [2021-12-22 13:32:11,381 INFO L470 AbstractCegarLoop]: Abstraction has has 155 places, 120 transitions, 668 flow [2021-12-22 13:32:11,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 89.77777777777777) internal successors, (808), 9 states have internal predecessors, (808), 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-12-22 13:32:11,382 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:11,382 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:11,382 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-22 13:32:11,382 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:11,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1688683518, now seen corresponding path program 1 times [2021-12-22 13:32:11,382 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:11,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694944904] [2021-12-22 13:32:11,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:11,382 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:11,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:11,493 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:11,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694944904] [2021-12-22 13:32:11,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694944904] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:11,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:11,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-22 13:32:11,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344575027] [2021-12-22 13:32:11,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:11,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-22 13:32:11,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:11,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-22 13:32:11,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-22 13:32:11,494 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:11,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 120 transitions, 668 flow. Second operand has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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-12-22 13:32:11,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:11,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:11,495 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:12,165 INFO L129 PetriNetUnfolder]: 1963/3975 cut-off events. [2021-12-22 13:32:12,166 INFO L130 PetriNetUnfolder]: For 57628/57949 co-relation queries the response was YES. [2021-12-22 13:32:12,183 INFO L84 FinitePrefix]: Finished finitePrefix Result has 19573 conditions, 3975 events. 1963/3975 cut-off events. For 57628/57949 co-relation queries the response was YES. Maximal size of possible extension queue 320. Compared 29776 event pairs, 273 based on Foata normal form. 236/4088 useless extension candidates. Maximal degree in co-relation 19483. Up to 1185 conditions per place. [2021-12-22 13:32:12,203 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 70 selfloop transitions, 7 changer transitions 112/269 dead transitions. [2021-12-22 13:32:12,203 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 269 transitions, 2726 flow [2021-12-22 13:32:12,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-22 13:32:12,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2021-12-22 13:32:12,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 962 transitions. [2021-12-22 13:32:12,206 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8589285714285714 [2021-12-22 13:32:12,206 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 962 transitions. [2021-12-22 13:32:12,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 962 transitions. [2021-12-22 13:32:12,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:12,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 962 transitions. [2021-12-22 13:32:12,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 96.2) internal successors, (962), 10 states have internal predecessors, (962), 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-12-22 13:32:12,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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-12-22 13:32:12,215 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 112.0) internal successors, (1232), 11 states have internal predecessors, (1232), 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-12-22 13:32:12,215 INFO L186 Difference]: Start difference. First operand has 155 places, 120 transitions, 668 flow. Second operand 10 states and 962 transitions. [2021-12-22 13:32:12,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 269 transitions, 2726 flow [2021-12-22 13:32:12,259 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 269 transitions, 2422 flow, removed 118 selfloop flow, removed 10 redundant places. [2021-12-22 13:32:12,262 INFO L242 Difference]: Finished difference. Result has 154 places, 123 transitions, 663 flow [2021-12-22 13:32:12,263 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=608, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=663, PETRI_PLACES=154, PETRI_TRANSITIONS=123} [2021-12-22 13:32:12,264 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 37 predicate places. [2021-12-22 13:32:12,264 INFO L470 AbstractCegarLoop]: Abstraction has has 154 places, 123 transitions, 663 flow [2021-12-22 13:32:12,265 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 90.33333333333333) internal successors, (542), 6 states have internal predecessors, (542), 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-12-22 13:32:12,265 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:12,265 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:12,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-22 13:32:12,265 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:12,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:12,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1739713126, now seen corresponding path program 1 times [2021-12-22 13:32:12,266 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:12,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381455574] [2021-12-22 13:32:12,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:12,266 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:12,356 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:12,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381455574] [2021-12-22 13:32:12,357 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381455574] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:12,357 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:12,357 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:32:12,357 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176323712] [2021-12-22 13:32:12,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:12,358 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:32:12,358 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:12,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:32:12,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:32:12,359 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:12,359 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 123 transitions, 663 flow. Second operand has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-12-22 13:32:12,359 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:12,359 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:12,359 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:12,833 INFO L129 PetriNetUnfolder]: 804/2570 cut-off events. [2021-12-22 13:32:12,834 INFO L130 PetriNetUnfolder]: For 15703/15970 co-relation queries the response was YES. [2021-12-22 13:32:12,847 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10606 conditions, 2570 events. 804/2570 cut-off events. For 15703/15970 co-relation queries the response was YES. Maximal size of possible extension queue 195. Compared 22736 event pairs, 257 based on Foata normal form. 53/2424 useless extension candidates. Maximal degree in co-relation 10515. Up to 552 conditions per place. [2021-12-22 13:32:12,857 INFO L132 encePairwiseOnDemand]: 105/112 looper letters, 55 selfloop transitions, 3 changer transitions 43/184 dead transitions. [2021-12-22 13:32:12,857 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 184 transitions, 1608 flow [2021-12-22 13:32:12,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-22 13:32:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2021-12-22 13:32:12,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 758 transitions. [2021-12-22 13:32:12,860 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8459821428571429 [2021-12-22 13:32:12,860 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 758 transitions. [2021-12-22 13:32:12,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 758 transitions. [2021-12-22 13:32:12,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:12,860 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 758 transitions. [2021-12-22 13:32:12,861 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 94.75) internal successors, (758), 8 states have internal predecessors, (758), 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-12-22 13:32:12,862 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 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-12-22 13:32:12,862 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 112.0) internal successors, (1008), 9 states have internal predecessors, (1008), 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-12-22 13:32:12,862 INFO L186 Difference]: Start difference. First operand has 154 places, 123 transitions, 663 flow. Second operand 8 states and 758 transitions. [2021-12-22 13:32:12,862 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 184 transitions, 1608 flow [2021-12-22 13:32:12,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 184 transitions, 1599 flow, removed 2 selfloop flow, removed 4 redundant places. [2021-12-22 13:32:12,880 INFO L242 Difference]: Finished difference. Result has 158 places, 123 transitions, 673 flow [2021-12-22 13:32:12,880 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=123, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=673, PETRI_PLACES=158, PETRI_TRANSITIONS=123} [2021-12-22 13:32:12,881 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 41 predicate places. [2021-12-22 13:32:12,881 INFO L470 AbstractCegarLoop]: Abstraction has has 158 places, 123 transitions, 673 flow [2021-12-22 13:32:12,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.42857142857143) internal successors, (633), 7 states have internal predecessors, (633), 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-12-22 13:32:12,881 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:12,881 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:12,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-22 13:32:12,881 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:12,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:12,883 INFO L85 PathProgramCache]: Analyzing trace with hash 575901384, now seen corresponding path program 2 times [2021-12-22 13:32:12,883 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:12,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18687040] [2021-12-22 13:32:12,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:12,884 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:12,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:12,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:12,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18687040] [2021-12-22 13:32:12,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18687040] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:12,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:12,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-22 13:32:12,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597736269] [2021-12-22 13:32:12,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:12,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-22 13:32:12,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:12,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-22 13:32:12,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-12-22 13:32:12,951 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:12,951 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 123 transitions, 673 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-12-22 13:32:12,951 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:12,951 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:12,951 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:13,374 INFO L129 PetriNetUnfolder]: 916/2283 cut-off events. [2021-12-22 13:32:13,375 INFO L130 PetriNetUnfolder]: For 19757/19938 co-relation queries the response was YES. [2021-12-22 13:32:13,387 INFO L84 FinitePrefix]: Finished finitePrefix Result has 10574 conditions, 2283 events. 916/2283 cut-off events. For 19757/19938 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 17481 event pairs, 57 based on Foata normal form. 170/2417 useless extension candidates. Maximal degree in co-relation 10482. Up to 533 conditions per place. [2021-12-22 13:32:13,392 INFO L132 encePairwiseOnDemand]: 102/112 looper letters, 67 selfloop transitions, 11 changer transitions 66/224 dead transitions. [2021-12-22 13:32:13,392 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 224 transitions, 2095 flow [2021-12-22 13:32:13,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:32:13,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:32:13,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1059 transitions. [2021-12-22 13:32:13,394 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.859577922077922 [2021-12-22 13:32:13,394 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1059 transitions. [2021-12-22 13:32:13,394 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1059 transitions. [2021-12-22 13:32:13,394 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:13,394 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1059 transitions. [2021-12-22 13:32:13,396 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 96.27272727272727) internal successors, (1059), 11 states have internal predecessors, (1059), 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-12-22 13:32:13,397 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-12-22 13:32:13,397 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-12-22 13:32:13,397 INFO L186 Difference]: Start difference. First operand has 158 places, 123 transitions, 673 flow. Second operand 11 states and 1059 transitions. [2021-12-22 13:32:13,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 224 transitions, 2095 flow [2021-12-22 13:32:13,419 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 156 places, 224 transitions, 2069 flow, removed 6 selfloop flow, removed 7 redundant places. [2021-12-22 13:32:13,421 INFO L242 Difference]: Finished difference. Result has 163 places, 127 transitions, 744 flow [2021-12-22 13:32:13,421 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=744, PETRI_PLACES=163, PETRI_TRANSITIONS=127} [2021-12-22 13:32:13,422 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 46 predicate places. [2021-12-22 13:32:13,422 INFO L470 AbstractCegarLoop]: Abstraction has has 163 places, 127 transitions, 744 flow [2021-12-22 13:32:13,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 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-12-22 13:32:13,422 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:13,422 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:13,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-22 13:32:13,423 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:13,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:13,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1327116483, now seen corresponding path program 1 times [2021-12-22 13:32:13,423 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:13,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84551496] [2021-12-22 13:32:13,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:13,424 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:13,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:13,492 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:13,492 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84551496] [2021-12-22 13:32:13,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84551496] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:13,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:13,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-22 13:32:13,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916014719] [2021-12-22 13:32:13,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:13,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-22 13:32:13,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:13,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-22 13:32:13,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-12-22 13:32:13,495 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 112 [2021-12-22 13:32:13,495 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 127 transitions, 744 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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-12-22 13:32:13,495 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:13,495 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 112 [2021-12-22 13:32:13,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:13,864 INFO L129 PetriNetUnfolder]: 645/1730 cut-off events. [2021-12-22 13:32:13,864 INFO L130 PetriNetUnfolder]: For 17338/17514 co-relation queries the response was YES. [2021-12-22 13:32:13,872 INFO L84 FinitePrefix]: Finished finitePrefix Result has 8838 conditions, 1730 events. 645/1730 cut-off events. For 17338/17514 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 13889 event pairs, 48 based on Foata normal form. 128/1826 useless extension candidates. Maximal degree in co-relation 8757. Up to 449 conditions per place. [2021-12-22 13:32:13,876 INFO L132 encePairwiseOnDemand]: 103/112 looper letters, 33 selfloop transitions, 12 changer transitions 82/204 dead transitions. [2021-12-22 13:32:13,876 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 204 transitions, 1915 flow [2021-12-22 13:32:13,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-22 13:32:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2021-12-22 13:32:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1217 transitions. [2021-12-22 13:32:13,878 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.8358516483516484 [2021-12-22 13:32:13,878 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1217 transitions. [2021-12-22 13:32:13,878 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1217 transitions. [2021-12-22 13:32:13,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:13,879 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1217 transitions. [2021-12-22 13:32:13,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 93.61538461538461) internal successors, (1217), 13 states have internal predecessors, (1217), 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-12-22 13:32:13,882 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-12-22 13:32:13,882 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 112.0) internal successors, (1568), 14 states have internal predecessors, (1568), 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-12-22 13:32:13,882 INFO L186 Difference]: Start difference. First operand has 163 places, 127 transitions, 744 flow. Second operand 13 states and 1217 transitions. [2021-12-22 13:32:13,882 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 204 transitions, 1915 flow [2021-12-22 13:32:13,909 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 204 transitions, 1621 flow, removed 133 selfloop flow, removed 13 redundant places. [2021-12-22 13:32:13,910 INFO L242 Difference]: Finished difference. Result has 165 places, 108 transitions, 511 flow [2021-12-22 13:32:13,911 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=617, PETRI_DIFFERENCE_MINUEND_PLACES=147, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=511, PETRI_PLACES=165, PETRI_TRANSITIONS=108} [2021-12-22 13:32:13,911 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 48 predicate places. [2021-12-22 13:32:13,911 INFO L470 AbstractCegarLoop]: Abstraction has has 165 places, 108 transitions, 511 flow [2021-12-22 13:32:13,912 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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-12-22 13:32:13,912 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:13,912 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:13,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-22 13:32:13,912 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:13,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:13,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1670884157, now seen corresponding path program 1 times [2021-12-22 13:32:13,913 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225109281] [2021-12-22 13:32:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:13,913 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-22 13:32:14,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-22 13:32:14,163 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-22 13:32:14,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225109281] [2021-12-22 13:32:14,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225109281] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-22 13:32:14,164 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-22 13:32:14,164 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2021-12-22 13:32:14,164 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616329440] [2021-12-22 13:32:14,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-22 13:32:14,164 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-22 13:32:14,165 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-22 13:32:14,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-22 13:32:14,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2021-12-22 13:32:14,166 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 112 [2021-12-22 13:32:14,167 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 108 transitions, 511 flow. Second operand has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 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-12-22 13:32:14,167 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2021-12-22 13:32:14,167 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 112 [2021-12-22 13:32:14,167 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2021-12-22 13:32:14,518 INFO L129 PetriNetUnfolder]: 71/481 cut-off events. [2021-12-22 13:32:14,519 INFO L130 PetriNetUnfolder]: For 1792/1839 co-relation queries the response was YES. [2021-12-22 13:32:14,522 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1617 conditions, 481 events. 71/481 cut-off events. For 1792/1839 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 2813 event pairs, 0 based on Foata normal form. 10/482 useless extension candidates. Maximal degree in co-relation 1518. Up to 83 conditions per place. [2021-12-22 13:32:14,523 INFO L132 encePairwiseOnDemand]: 101/112 looper letters, 31 selfloop transitions, 8 changer transitions 14/130 dead transitions. [2021-12-22 13:32:14,523 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 161 places, 130 transitions, 753 flow [2021-12-22 13:32:14,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-12-22 13:32:14,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2021-12-22 13:32:14,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 970 transitions. [2021-12-22 13:32:14,525 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7873376623376623 [2021-12-22 13:32:14,525 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 970 transitions. [2021-12-22 13:32:14,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 970 transitions. [2021-12-22 13:32:14,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-22 13:32:14,526 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 970 transitions. [2021-12-22 13:32:14,527 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 88.18181818181819) internal successors, (970), 11 states have internal predecessors, (970), 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-12-22 13:32:14,529 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-12-22 13:32:14,529 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 112.0) internal successors, (1344), 12 states have internal predecessors, (1344), 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-12-22 13:32:14,529 INFO L186 Difference]: Start difference. First operand has 165 places, 108 transitions, 511 flow. Second operand 11 states and 970 transitions. [2021-12-22 13:32:14,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 161 places, 130 transitions, 753 flow [2021-12-22 13:32:14,535 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 130 transitions, 521 flow, removed 80 selfloop flow, removed 34 redundant places. [2021-12-22 13:32:14,536 INFO L242 Difference]: Finished difference. Result has 132 places, 107 transitions, 358 flow [2021-12-22 13:32:14,536 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=112, PETRI_DIFFERENCE_MINUEND_FLOW=335, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=108, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=358, PETRI_PLACES=132, PETRI_TRANSITIONS=107} [2021-12-22 13:32:14,537 INFO L334 CegarLoopForPetriNet]: 117 programPoint places, 15 predicate places. [2021-12-22 13:32:14,537 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 107 transitions, 358 flow [2021-12-22 13:32:14,538 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 85.64285714285714) internal successors, (1199), 14 states have internal predecessors, (1199), 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-12-22 13:32:14,538 INFO L246 CegarLoopForPetriNet]: Found error trace [2021-12-22 13:32:14,538 INFO L254 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:14,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-22 13:32:14,538 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-12-22 13:32:14,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-22 13:32:14,539 INFO L85 PathProgramCache]: Analyzing trace with hash 138883637, now seen corresponding path program 2 times [2021-12-22 13:32:14,539 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-22 13:32:14,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521878494] [2021-12-22 13:32:14,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-22 13:32:14,539 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-22 13:32:14,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:32:14,578 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-22 13:32:14,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-22 13:32:14,653 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-22 13:32:14,653 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-22 13:32:14,654 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-12-22 13:32:14,655 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-12-22 13:32:14,656 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-12-22 13:32:14,656 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-12-22 13:32:14,656 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-12-22 13:32:14,656 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-12-22 13:32:14,656 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-22 13:32:14,659 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-22 13:32:14,664 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-12-22 13:32:14,664 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-22 13:32:14,767 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.12 01:32:14 BasicIcfg [2021-12-22 13:32:14,767 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-22 13:32:14,768 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-22 13:32:14,768 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-22 13:32:14,768 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-22 13:32:14,768 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.12 01:32:04" (3/4) ... [2021-12-22 13:32:14,770 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-22 13:32:14,863 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-22 13:32:14,864 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-22 13:32:14,866 INFO L158 Benchmark]: Toolchain (without parser) took 11565.12ms. Allocated memory was 104.9MB in the beginning and 740.3MB in the end (delta: 635.4MB). Free memory was 73.1MB in the beginning and 543.5MB in the end (delta: -470.4MB). Peak memory consumption was 164.1MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,866 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 104.9MB. Free memory was 59.6MB in the beginning and 59.5MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-22 13:32:14,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 463.02ms. Allocated memory is still 104.9MB. Free memory was 72.9MB in the beginning and 69.0MB in the end (delta: 3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.68ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,866 INFO L158 Benchmark]: Boogie Preprocessor took 27.94ms. Allocated memory is still 104.9MB. Free memory was 65.9MB in the beginning and 63.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,867 INFO L158 Benchmark]: RCFGBuilder took 773.50ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 63.5MB in the beginning and 55.2MB in the end (delta: 8.3MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,867 INFO L158 Benchmark]: TraceAbstraction took 10132.72ms. Allocated memory was 142.6MB in the beginning and 740.3MB in the end (delta: 597.7MB). Free memory was 55.2MB in the beginning and 569.7MB in the end (delta: -514.5MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,867 INFO L158 Benchmark]: Witness Printer took 96.04ms. Allocated memory is still 740.3MB. Free memory was 569.7MB in the beginning and 543.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2021-12-22 13:32:14,869 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.20ms. Allocated memory is still 104.9MB. Free memory was 59.6MB in the beginning and 59.5MB in the end (delta: 48.7kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 463.02ms. Allocated memory is still 104.9MB. Free memory was 72.9MB in the beginning and 69.0MB in the end (delta: 3.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.68ms. Allocated memory is still 104.9MB. Free memory was 68.6MB in the beginning and 65.9MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.94ms. Allocated memory is still 104.9MB. Free memory was 65.9MB in the beginning and 63.5MB in the end (delta: 2.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 773.50ms. Allocated memory was 104.9MB in the beginning and 142.6MB in the end (delta: 37.7MB). Free memory was 63.5MB in the beginning and 55.2MB in the end (delta: 8.3MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. * TraceAbstraction took 10132.72ms. Allocated memory was 142.6MB in the beginning and 740.3MB in the end (delta: 597.7MB). Free memory was 55.2MB in the beginning and 569.7MB in the end (delta: -514.5MB). Peak memory consumption was 85.3MB. Max. memory is 16.1GB. * Witness Printer took 96.04ms. Allocated memory is still 740.3MB. Free memory was 569.7MB in the beginning and 543.5MB in the end (delta: 26.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L813] 0 pthread_t t2177; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L814] FCALL, FORK 0 pthread_create(&t2177, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2177, ((void *)0), P0, ((void *)0))=-2, t2177={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2178; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2178, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2178, ((void *)0), P1, ((void *)0))=-1, t2177={5:0}, t2178={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2179; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2179, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2179, ((void *)0), P2, ((void *)0))=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L743] CALL 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L743] RET 1 __VERIFIER_assert(!(y$w_buff1_used && y$w_buff0_used)) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, 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=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) VAL [\old(cond)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, cond=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] RET 0 assume_abort_if_not(main$tmp_guard0) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2177={5:0}, t2178={6:0}, t2179={3:0}, weak$$choice0=67, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=0, expression=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] 0 reach_error() VAL [\old(expression)=0, \old(expression)=1, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, expression=1, expression=0, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=67, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 816]: 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: 818]: 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: 814]: 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, 138 locations, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 9.9s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 7.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 898 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 898 mSDsluCounter, 819 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1421 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2307 IncrementalHoareTripleChecker+Invalid, 2587 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 165 mSDtfsCounter, 2307 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 216 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 473 ImplicationChecksByTransitivity, 1.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=744occurred in iteration=15, InterpolantAutomatonStates: 194, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1385 NumberOfCodeBlocks, 1385 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1282 ConstructedInterpolants, 0 QuantifiedInterpolants, 7402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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-12-22 13:32:14,925 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... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE