./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe030_power.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 997cd7c3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe030_power.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 f95b811d25aee10b6f2a8b74d7fa37a6425dbdbf ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-997cd7c-m [2021-09-22 14:52:20,146 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:52:20,152 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:52:20,183 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:52:20,183 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:52:20,185 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:52:20,186 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:52:20,190 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:52:20,192 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:52:20,196 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:52:20,196 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:52:20,199 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:52:20,200 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:52:20,201 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:52:20,203 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:52:20,206 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:52:20,207 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:52:20,207 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:52:20,209 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:52:20,215 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:52:20,217 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:52:20,218 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:52:20,219 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:52:20,220 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:52:20,224 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:52:20,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:52:20,226 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:52:20,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:52:20,227 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:52:20,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:52:20,228 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:52:20,229 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:52:20,230 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:52:20,230 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:52:20,231 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:52:20,231 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:52:20,232 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:52:20,232 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:52:20,232 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:52:20,233 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:52:20,234 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:52:20,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:52:20,261 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:52:20,262 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:52:20,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:52:20,263 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:52:20,264 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:52:20,264 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:52:20,264 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:52:20,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:52:20,265 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:52:20,265 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:52:20,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:52:20,267 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:52:20,267 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:52:20,267 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:52:20,267 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:52:20,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:52:20,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:52:20,268 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:52:20,268 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:52:20,268 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:52:20,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:52:20,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:52:20,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:52:20,268 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:52:20,269 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 -> f95b811d25aee10b6f2a8b74d7fa37a6425dbdbf [2021-09-22 14:52:20,501 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:52:20,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:52:20,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:52:20,517 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:52:20,518 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:52:20,518 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe030_power.opt.i [2021-09-22 14:52:20,574 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca195f5e/5aa6aa9006fc40adaf76e741f4bee1c6/FLAG0e9ec6d14 [2021-09-22 14:52:20,976 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:52:20,977 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i [2021-09-22 14:52:20,999 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca195f5e/5aa6aa9006fc40adaf76e741f4bee1c6/FLAG0e9ec6d14 [2021-09-22 14:52:21,007 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eca195f5e/5aa6aa9006fc40adaf76e741f4bee1c6 [2021-09-22 14:52:21,009 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:52:21,010 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:52:21,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:52:21,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:52:21,013 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:52:21,014 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,014 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee74b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21, skipping insertion in model container [2021-09-22 14:52:21,014 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,019 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:52:21,041 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:52:21,134 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i[951,964] [2021-09-22 14:52:21,291 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:52:21,297 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:52:21,305 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe030_power.opt.i[951,964] [2021-09-22 14:52:21,358 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:52:21,398 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:52:21,398 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21 WrapperNode [2021-09-22 14:52:21,399 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:52:21,400 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:52:21,401 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:52:21,401 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:52:21,405 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,432 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,467 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:52:21,470 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:52:21,470 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:52:21,470 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:52:21,476 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,476 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,491 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,497 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,510 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,512 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,514 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:52:21,515 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:52:21,515 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:52:21,515 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:52:21,516 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (1/1) ... [2021-09-22 14:52:21,525 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:52:21,534 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:52:21,543 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-22 14:52:21,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-22 14:52:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:52:21,581 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:52:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:52:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:52:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:52:21,582 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:52:21,582 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:52:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:52:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:52:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:52:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:52:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:52:21,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:52:21,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:52:21,584 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:52:22,685 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:52:22,685 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:52:22,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:52:22 BoogieIcfgContainer [2021-09-22 14:52:22,688 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:52:22,690 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:52:22,690 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:52:22,692 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:52:22,692 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:52:21" (1/3) ... [2021-09-22 14:52:22,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8007e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:52:22, skipping insertion in model container [2021-09-22 14:52:22,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:52:21" (2/3) ... [2021-09-22 14:52:22,693 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a8007e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:52:22, skipping insertion in model container [2021-09-22 14:52:22,693 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:52:22" (3/3) ... [2021-09-22 14:52:22,694 INFO L111 eAbstractionObserver]: Analyzing ICFG safe030_power.opt.i [2021-09-22 14:52:22,698 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:52:22,698 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:52:22,698 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:52:22,698 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:52:22,727 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,728 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,728 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,729 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,729 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,730 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,731 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,732 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,732 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,732 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,733 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,733 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,734 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,735 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,736 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,737 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,738 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,739 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,739 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,740 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,745 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,746 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,747 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,748 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,749 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,753 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,754 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,754 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,755 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,755 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,757 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,757 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,758 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,760 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,761 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,762 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,763 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:52:22,769 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:52:22,803 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:52:22,812 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-22 14:52:22,812 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-22 14:52:22,822 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:52:22,829 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 223 flow [2021-09-22 14:52:22,831 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 223 flow [2021-09-22 14:52:22,832 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-09-22 14:52:22,865 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-09-22 14:52:22,865 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:52:22,869 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 50 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-09-22 14:52:22,872 INFO L116 LiptonReduction]: Number of co-enabled transitions 1734 [2021-09-22 14:52:29,506 INFO L131 LiptonReduction]: Checked pairs total: 4116 [2021-09-22 14:52:29,506 INFO L133 LiptonReduction]: Total number of compositions: 90 [2021-09-22 14:52:29,512 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 27 transitions, 69 flow [2021-09-22 14:52:29,548 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-09-22 14:52:29,555 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:29,555 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:29,555 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:29,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:29,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1316732038, now seen corresponding path program 1 times [2021-09-22 14:52:29,565 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:29,565 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060490386] [2021-09-22 14:52:29,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:29,566 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:29,724 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:29,724 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060490386] [2021-09-22 14:52:29,725 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060490386] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:29,725 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:29,725 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:52:29,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727856330] [2021-09-22 14:52:29,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:52:29,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:29,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:52:29,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:52:29,741 INFO L87 Difference]: Start difference. First operand has 690 states, 687 states have (on average 3.304221251819505) internal successors, (2270), 689 states have internal predecessors, (2270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:29,786 INFO L93 Difference]: Finished difference Result 570 states and 1744 transitions. [2021-09-22 14:52:29,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:52:29,787 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-09-22 14:52:29,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:29,797 INFO L225 Difference]: With dead ends: 570 [2021-09-22 14:52:29,797 INFO L226 Difference]: Without dead ends: 550 [2021-09-22 14:52:29,798 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:52:29,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-09-22 14:52:29,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 550. [2021-09-22 14:52:29,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 549 states have (on average 3.083788706739526) internal successors, (1693), 549 states have internal predecessors, (1693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1693 transitions. [2021-09-22 14:52:29,842 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1693 transitions. Word has length 7 [2021-09-22 14:52:29,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:29,843 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 1693 transitions. [2021-09-22 14:52:29,843 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,843 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1693 transitions. [2021-09-22 14:52:29,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-22 14:52:29,844 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:29,844 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:29,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:52:29,845 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:29,845 INFO L82 PathProgramCache]: Analyzing trace with hash -826496317, now seen corresponding path program 1 times [2021-09-22 14:52:29,846 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:29,846 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991864695] [2021-09-22 14:52:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:29,846 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:29,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:29,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:29,925 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:29,925 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991864695] [2021-09-22 14:52:29,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991864695] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:29,926 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:29,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:52:29,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586472572] [2021-09-22 14:52:29,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:52:29,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:29,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:52:29,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:52:29,928 INFO L87 Difference]: Start difference. First operand 550 states and 1693 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:29,952 INFO L93 Difference]: Finished difference Result 630 states and 1862 transitions. [2021-09-22 14:52:29,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:52:29,952 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-22 14:52:29,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:29,955 INFO L225 Difference]: With dead ends: 630 [2021-09-22 14:52:29,955 INFO L226 Difference]: Without dead ends: 530 [2021-09-22 14:52:29,956 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-09-22 14:52:29,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2021-09-22 14:52:29,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 530 states, 529 states have (on average 3.056710775047259) internal successors, (1617), 529 states have internal predecessors, (1617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 1617 transitions. [2021-09-22 14:52:29,969 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 1617 transitions. Word has length 10 [2021-09-22 14:52:29,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:29,969 INFO L470 AbstractCegarLoop]: Abstraction has 530 states and 1617 transitions. [2021-09-22 14:52:29,969 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:29,969 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 1617 transitions. [2021-09-22 14:52:29,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:52:29,970 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:29,971 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:29,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:52:29,971 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:29,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:29,971 INFO L82 PathProgramCache]: Analyzing trace with hash -36677151, now seen corresponding path program 1 times [2021-09-22 14:52:29,972 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:29,972 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530468909] [2021-09-22 14:52:29,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:29,972 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:30,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:30,063 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:30,064 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530468909] [2021-09-22 14:52:30,064 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530468909] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:30,064 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:30,065 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:52:30,065 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682785841] [2021-09-22 14:52:30,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:52:30,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:30,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:52:30,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:52:30,071 INFO L87 Difference]: Start difference. First operand 530 states and 1617 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:30,094 INFO L93 Difference]: Finished difference Result 594 states and 1749 transitions. [2021-09-22 14:52:30,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:52:30,095 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-22 14:52:30,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:30,098 INFO L225 Difference]: With dead ends: 594 [2021-09-22 14:52:30,098 INFO L226 Difference]: Without dead ends: 514 [2021-09-22 14:52:30,098 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:30,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2021-09-22 14:52:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 514. [2021-09-22 14:52:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 3.0350877192982457) internal successors, (1557), 513 states have internal predecessors, (1557), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1557 transitions. [2021-09-22 14:52:30,109 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1557 transitions. Word has length 11 [2021-09-22 14:52:30,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:30,109 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 1557 transitions. [2021-09-22 14:52:30,109 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,109 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1557 transitions. [2021-09-22 14:52:30,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:52:30,112 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:30,112 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:30,113 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:52:30,113 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:30,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:30,113 INFO L82 PathProgramCache]: Analyzing trace with hash 201605146, now seen corresponding path program 1 times [2021-09-22 14:52:30,113 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:30,113 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015498180] [2021-09-22 14:52:30,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:30,114 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:30,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:30,187 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:30,187 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015498180] [2021-09-22 14:52:30,188 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015498180] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:30,188 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:30,188 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:52:30,188 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32384148] [2021-09-22 14:52:30,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:52:30,189 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:30,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:52:30,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:52:30,189 INFO L87 Difference]: Start difference. First operand 514 states and 1557 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:30,211 INFO L93 Difference]: Finished difference Result 800 states and 2294 transitions. [2021-09-22 14:52:30,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:52:30,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-22 14:52:30,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:30,214 INFO L225 Difference]: With dead ends: 800 [2021-09-22 14:52:30,214 INFO L226 Difference]: Without dead ends: 574 [2021-09-22 14:52:30,214 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:30,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-09-22 14:52:30,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 494. [2021-09-22 14:52:30,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 494 states, 493 states have (on average 2.8864097363083165) internal successors, (1423), 493 states have internal predecessors, (1423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 494 states to 494 states and 1423 transitions. [2021-09-22 14:52:30,226 INFO L78 Accepts]: Start accepts. Automaton has 494 states and 1423 transitions. Word has length 12 [2021-09-22 14:52:30,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:30,226 INFO L470 AbstractCegarLoop]: Abstraction has 494 states and 1423 transitions. [2021-09-22 14:52:30,226 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,226 INFO L276 IsEmpty]: Start isEmpty. Operand 494 states and 1423 transitions. [2021-09-22 14:52:30,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:52:30,227 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:30,227 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:30,227 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:52:30,228 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 537088343, now seen corresponding path program 1 times [2021-09-22 14:52:30,229 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:30,229 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375059931] [2021-09-22 14:52:30,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:30,230 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:30,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:30,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:30,333 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:30,333 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375059931] [2021-09-22 14:52:30,333 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375059931] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:30,333 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:30,334 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:52:30,334 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966967942] [2021-09-22 14:52:30,334 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:52:30,334 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:30,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:52:30,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:30,340 INFO L87 Difference]: Start difference. First operand 494 states and 1423 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:30,383 INFO L93 Difference]: Finished difference Result 548 states and 1537 transitions. [2021-09-22 14:52:30,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:52:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-22 14:52:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:30,385 INFO L225 Difference]: With dead ends: 548 [2021-09-22 14:52:30,385 INFO L226 Difference]: Without dead ends: 488 [2021-09-22 14:52:30,386 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.4ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:52:30,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2021-09-22 14:52:30,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2021-09-22 14:52:30,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 487 states have (on average 2.8767967145790556) internal successors, (1401), 487 states have internal predecessors, (1401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 1401 transitions. [2021-09-22 14:52:30,412 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 1401 transitions. Word has length 12 [2021-09-22 14:52:30,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:30,412 INFO L470 AbstractCegarLoop]: Abstraction has 488 states and 1401 transitions. [2021-09-22 14:52:30,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,412 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 1401 transitions. [2021-09-22 14:52:30,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:52:30,413 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:30,413 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:30,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:52:30,414 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:30,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:30,414 INFO L82 PathProgramCache]: Analyzing trace with hash -543856079, now seen corresponding path program 1 times [2021-09-22 14:52:30,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:30,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1874321688] [2021-09-22 14:52:30,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:30,415 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:30,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:30,499 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:30,502 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1874321688] [2021-09-22 14:52:30,503 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1874321688] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:30,503 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:30,503 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:52:30,503 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503390740] [2021-09-22 14:52:30,504 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:52:30,504 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:30,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:52:30,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:52:30,505 INFO L87 Difference]: Start difference. First operand 488 states and 1401 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:30,576 INFO L93 Difference]: Finished difference Result 534 states and 1489 transitions. [2021-09-22 14:52:30,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:52:30,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-22 14:52:30,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:30,579 INFO L225 Difference]: With dead ends: 534 [2021-09-22 14:52:30,579 INFO L226 Difference]: Without dead ends: 474 [2021-09-22 14:52:30,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 27.5ms TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:52:30,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2021-09-22 14:52:30,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2021-09-22 14:52:30,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 473 states have (on average 2.8520084566596196) internal successors, (1349), 473 states have internal predecessors, (1349), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 1349 transitions. [2021-09-22 14:52:30,588 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 1349 transitions. Word has length 13 [2021-09-22 14:52:30,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:30,589 INFO L470 AbstractCegarLoop]: Abstraction has 474 states and 1349 transitions. [2021-09-22 14:52:30,589 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,589 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 1349 transitions. [2021-09-22 14:52:30,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:52:30,590 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:30,590 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:30,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:52:30,590 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:30,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:30,594 INFO L82 PathProgramCache]: Analyzing trace with hash -590955650, now seen corresponding path program 1 times [2021-09-22 14:52:30,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:30,594 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790357722] [2021-09-22 14:52:30,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:30,594 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:30,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:30,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:30,691 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:30,691 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1790357722] [2021-09-22 14:52:30,691 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1790357722] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:30,691 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:30,691 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:52:30,691 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942085435] [2021-09-22 14:52:30,691 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:52:30,691 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:52:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:52:30,692 INFO L87 Difference]: Start difference. First operand 474 states and 1349 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:30,761 INFO L93 Difference]: Finished difference Result 505 states and 1407 transitions. [2021-09-22 14:52:30,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:52:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-09-22 14:52:30,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:30,766 INFO L225 Difference]: With dead ends: 505 [2021-09-22 14:52:30,766 INFO L226 Difference]: Without dead ends: 460 [2021-09-22 14:52:30,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 27.0ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:52:30,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2021-09-22 14:52:30,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 456. [2021-09-22 14:52:30,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 455 states have (on average 2.832967032967033) internal successors, (1289), 455 states have internal predecessors, (1289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 1289 transitions. [2021-09-22 14:52:30,785 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 1289 transitions. Word has length 13 [2021-09-22 14:52:30,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:30,785 INFO L470 AbstractCegarLoop]: Abstraction has 456 states and 1289 transitions. [2021-09-22 14:52:30,785 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 1289 transitions. [2021-09-22 14:52:30,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:52:30,786 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:30,786 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:30,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:52:30,786 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:30,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:30,787 INFO L82 PathProgramCache]: Analyzing trace with hash 259505636, now seen corresponding path program 1 times [2021-09-22 14:52:30,787 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:30,787 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003861781] [2021-09-22 14:52:30,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:30,787 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:30,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:30,871 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:30,872 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003861781] [2021-09-22 14:52:30,872 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003861781] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:30,872 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:30,872 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:52:30,872 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767784252] [2021-09-22 14:52:30,872 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:52:30,872 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:30,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:52:30,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:52:30,873 INFO L87 Difference]: Start difference. First operand 456 states and 1289 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:30,982 INFO L93 Difference]: Finished difference Result 597 states and 1647 transitions. [2021-09-22 14:52:30,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-09-22 14:52:30,982 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-22 14:52:30,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:30,984 INFO L225 Difference]: With dead ends: 597 [2021-09-22 14:52:30,984 INFO L226 Difference]: Without dead ends: 530 [2021-09-22 14:52:30,985 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 62.1ms TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:52:30,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2021-09-22 14:52:30,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 514. [2021-09-22 14:52:30,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 514 states, 513 states have (on average 2.7855750487329436) internal successors, (1429), 513 states have internal predecessors, (1429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 514 states to 514 states and 1429 transitions. [2021-09-22 14:52:30,995 INFO L78 Accepts]: Start accepts. Automaton has 514 states and 1429 transitions. Word has length 14 [2021-09-22 14:52:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:30,996 INFO L470 AbstractCegarLoop]: Abstraction has 514 states and 1429 transitions. [2021-09-22 14:52:30,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:30,996 INFO L276 IsEmpty]: Start isEmpty. Operand 514 states and 1429 transitions. [2021-09-22 14:52:30,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:52:30,997 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:30,997 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:30,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:52:30,997 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:30,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:30,998 INFO L82 PathProgramCache]: Analyzing trace with hash 553266248, now seen corresponding path program 1 times [2021-09-22 14:52:30,998 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:30,998 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444766716] [2021-09-22 14:52:30,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:30,998 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:31,029 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:31,030 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:31,030 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444766716] [2021-09-22 14:52:31,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444766716] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:31,030 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:31,030 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:52:31,030 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634624959] [2021-09-22 14:52:31,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:52:31,031 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:31,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:52:31,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:52:31,031 INFO L87 Difference]: Start difference. First operand 514 states and 1429 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:31,048 INFO L93 Difference]: Finished difference Result 759 states and 2028 transitions. [2021-09-22 14:52:31,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:52:31,048 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-22 14:52:31,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:31,050 INFO L225 Difference]: With dead ends: 759 [2021-09-22 14:52:31,051 INFO L226 Difference]: Without dead ends: 470 [2021-09-22 14:52:31,051 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2021-09-22 14:52:31,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 434. [2021-09-22 14:52:31,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.6397228637413397) internal successors, (1143), 433 states have internal predecessors, (1143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1143 transitions. [2021-09-22 14:52:31,059 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1143 transitions. Word has length 14 [2021-09-22 14:52:31,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:31,059 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1143 transitions. [2021-09-22 14:52:31,060 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,060 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1143 transitions. [2021-09-22 14:52:31,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:52:31,061 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:31,061 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:31,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:52:31,061 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:31,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:31,061 INFO L82 PathProgramCache]: Analyzing trace with hash -545281544, now seen corresponding path program 1 times [2021-09-22 14:52:31,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:31,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708322359] [2021-09-22 14:52:31,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:31,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:31,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:31,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:31,196 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:31,197 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708322359] [2021-09-22 14:52:31,197 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708322359] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:31,197 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:31,197 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-09-22 14:52:31,197 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676578694] [2021-09-22 14:52:31,197 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-09-22 14:52:31,198 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:31,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-09-22 14:52:31,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-09-22 14:52:31,198 INFO L87 Difference]: Start difference. First operand 434 states and 1143 transitions. Second operand has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:31,298 INFO L93 Difference]: Finished difference Result 530 states and 1345 transitions. [2021-09-22 14:52:31,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-09-22 14:52:31,298 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-22 14:52:31,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:31,300 INFO L225 Difference]: With dead ends: 530 [2021-09-22 14:52:31,300 INFO L226 Difference]: Without dead ends: 326 [2021-09-22 14:52:31,300 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 75.2ms TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2021-09-22 14:52:31,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-09-22 14:52:31,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 272. [2021-09-22 14:52:31,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 271 states have (on average 2.5645756457564577) internal successors, (695), 271 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 695 transitions. [2021-09-22 14:52:31,306 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 695 transitions. Word has length 15 [2021-09-22 14:52:31,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:31,306 INFO L470 AbstractCegarLoop]: Abstraction has 272 states and 695 transitions. [2021-09-22 14:52:31,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,306 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 695 transitions. [2021-09-22 14:52:31,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:52:31,307 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:31,307 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:31,307 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:52:31,307 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:31,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:31,307 INFO L82 PathProgramCache]: Analyzing trace with hash -28591036, now seen corresponding path program 1 times [2021-09-22 14:52:31,307 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:31,307 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698434573] [2021-09-22 14:52:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:31,308 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:31,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:31,369 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:31,369 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698434573] [2021-09-22 14:52:31,370 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698434573] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:31,370 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:31,370 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:52:31,370 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679267266] [2021-09-22 14:52:31,370 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:52:31,370 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:31,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:52:31,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:52:31,371 INFO L87 Difference]: Start difference. First operand 272 states and 695 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:31,385 INFO L93 Difference]: Finished difference Result 266 states and 588 transitions. [2021-09-22 14:52:31,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:52:31,385 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-09-22 14:52:31,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:31,386 INFO L225 Difference]: With dead ends: 266 [2021-09-22 14:52:31,386 INFO L226 Difference]: Without dead ends: 196 [2021-09-22 14:52:31,387 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:31,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-09-22 14:52:31,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-09-22 14:52:31,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 2.1794871794871793) internal successors, (425), 195 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 425 transitions. [2021-09-22 14:52:31,390 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 425 transitions. Word has length 15 [2021-09-22 14:52:31,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:31,391 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 425 transitions. [2021-09-22 14:52:31,391 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,391 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 425 transitions. [2021-09-22 14:52:31,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-09-22 14:52:31,392 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:31,392 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:31,392 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:52:31,392 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:31,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:31,393 INFO L82 PathProgramCache]: Analyzing trace with hash -997626623, now seen corresponding path program 1 times [2021-09-22 14:52:31,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:31,393 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59437120] [2021-09-22 14:52:31,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:31,393 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:31,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:31,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:31,454 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:31,454 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59437120] [2021-09-22 14:52:31,454 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59437120] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:31,454 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:31,454 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:52:31,454 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086936146] [2021-09-22 14:52:31,454 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:52:31,455 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:31,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:52:31,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:52:31,455 INFO L87 Difference]: Start difference. First operand 196 states and 425 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:31,480 INFO L93 Difference]: Finished difference Result 156 states and 293 transitions. [2021-09-22 14:52:31,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:52:31,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-09-22 14:52:31,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:31,481 INFO L225 Difference]: With dead ends: 156 [2021-09-22 14:52:31,481 INFO L226 Difference]: Without dead ends: 114 [2021-09-22 14:52:31,481 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 15.4ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:52:31,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2021-09-22 14:52:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2021-09-22 14:52:31,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 113 states have (on average 1.7964601769911503) internal successors, (203), 113 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 203 transitions. [2021-09-22 14:52:31,483 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 203 transitions. Word has length 16 [2021-09-22 14:52:31,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:31,484 INFO L470 AbstractCegarLoop]: Abstraction has 114 states and 203 transitions. [2021-09-22 14:52:31,484 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,484 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 203 transitions. [2021-09-22 14:52:31,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-09-22 14:52:31,484 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:31,484 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:31,485 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:52:31,485 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:31,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:31,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1781703993, now seen corresponding path program 1 times [2021-09-22 14:52:31,485 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:31,485 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023567284] [2021-09-22 14:52:31,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:31,486 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:31,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:52:31,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:52:31,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:52:31,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023567284] [2021-09-22 14:52:31,542 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023567284] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:52:31,542 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:52:31,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:52:31,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544180637] [2021-09-22 14:52:31,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:52:31,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:52:31,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:52:31,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:52:31,544 INFO L87 Difference]: Start difference. First operand 114 states and 203 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:52:31,578 INFO L93 Difference]: Finished difference Result 94 states and 163 transitions. [2021-09-22 14:52:31,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:52:31,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-09-22 14:52:31,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:52:31,579 INFO L225 Difference]: With dead ends: 94 [2021-09-22 14:52:31,579 INFO L226 Difference]: Without dead ends: 36 [2021-09-22 14:52:31,579 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:52:31,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-09-22 14:52:31,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2021-09-22 14:52:31,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 35 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 53 transitions. [2021-09-22 14:52:31,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 53 transitions. Word has length 18 [2021-09-22 14:52:31,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:52:31,581 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 53 transitions. [2021-09-22 14:52:31,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:52:31,581 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 53 transitions. [2021-09-22 14:52:31,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-09-22 14:52:31,581 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:52:31,581 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:52:31,581 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-09-22 14:52:31,582 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:52:31,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:52:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash -373911187, now seen corresponding path program 1 times [2021-09-22 14:52:31,582 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:52:31,582 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203036842] [2021-09-22 14:52:31,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:52:31,582 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:52:31,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:52:31,603 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:52:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:52:31,644 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:52:31,645 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:52:31,645 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:52:31,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:52:31,646 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:52:31,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:52:31,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:52:31,647 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:52:31,647 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-09-22 14:52:31,651 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:52:31,651 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:52:31,715 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:52:31 BasicIcfg [2021-09-22 14:52:31,715 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:52:31,716 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:52:31,719 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:52:31,719 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:52:31,719 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:52:22" (3/4) ... [2021-09-22 14:52:31,721 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:52:31,783 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:52:31,783 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:52:31,784 INFO L168 Benchmark]: Toolchain (without parser) took 10773.45 ms. Allocated memory was 56.6 MB in the beginning and 161.5 MB in the end (delta: 104.9 MB). Free memory was 39.5 MB in the beginning and 78.9 MB in the end (delta: -39.3 MB). Peak memory consumption was 66.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,784 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 46.1 MB. Free memory was 28.4 MB in the beginning and 28.4 MB in the end (delta: 51.9 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:52:31,785 INFO L168 Benchmark]: CACSL2BoogieTranslator took 389.08 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 37.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,785 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 56.6 MB. Free memory was 37.7 MB in the beginning and 34.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,785 INFO L168 Benchmark]: Boogie Preprocessor took 44.65 ms. Allocated memory is still 56.6 MB. Free memory was 34.9 MB in the beginning and 32.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,785 INFO L168 Benchmark]: RCFGBuilder took 1173.27 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 32.8 MB in the beginning and 36.0 MB in the end (delta: -3.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,786 INFO L168 Benchmark]: TraceAbstraction took 9025.73 ms. Allocated memory was 75.5 MB in the beginning and 161.5 MB in the end (delta: 86.0 MB). Free memory was 35.5 MB in the beginning and 91.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,786 INFO L168 Benchmark]: Witness Printer took 67.09 ms. Allocated memory is still 161.5 MB. Free memory was 91.4 MB in the beginning and 78.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:52:31,788 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.13 ms. Allocated memory is still 46.1 MB. Free memory was 28.4 MB in the beginning and 28.4 MB in the end (delta: 51.9 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 389.08 ms. Allocated memory is still 56.6 MB. Free memory was 39.3 MB in the beginning and 37.7 MB in the end (delta: 1.6 MB). Peak memory consumption was 16.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 56.6 MB. Free memory was 37.7 MB in the beginning and 34.9 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 44.65 ms. Allocated memory is still 56.6 MB. Free memory was 34.9 MB in the beginning and 32.8 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1173.27 ms. Allocated memory was 56.6 MB in the beginning and 75.5 MB in the end (delta: 18.9 MB). Free memory was 32.8 MB in the beginning and 36.0 MB in the end (delta: -3.2 MB). Peak memory consumption was 23.2 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9025.73 ms. Allocated memory was 75.5 MB in the beginning and 161.5 MB in the end (delta: 86.0 MB). Free memory was 35.5 MB in the beginning and 91.4 MB in the end (delta: -55.9 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Witness Printer took 67.09 ms. Allocated memory is still 161.5 MB. Free memory was 91.4 MB in the beginning and 78.9 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6675.6ms, 112 PlacesBefore, 36 PlacesAfterwards, 104 TransitionsBefore, 27 TransitionsAfterwards, 1734 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 45 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 8 ConcurrentYvCompositions, 1 ChoiceCompositions, 90 TotalNumberOfCompositions, 4116 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2083, positive: 1948, positive conditional: 0, positive unconditional: 1948, negative: 135, negative conditional: 0, negative unconditional: 135, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1222, positive: 1182, positive conditional: 0, positive unconditional: 1182, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1222, positive: 1162, positive conditional: 0, positive unconditional: 1162, negative: 60, negative conditional: 0, negative unconditional: 60, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 60, positive: 20, positive conditional: 0, positive unconditional: 20, negative: 40, negative conditional: 0, negative unconditional: 40, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, positive: 18, positive conditional: 0, positive unconditional: 18, negative: 248, negative conditional: 0, negative unconditional: 248, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2083, positive: 766, positive conditional: 0, positive unconditional: 766, negative: 95, negative conditional: 0, negative unconditional: 95, unknown: 1222, unknown conditional: 0, unknown unconditional: 1222] , Statistics on independence cache: Total cache size (in pairs): 122, Positive cache size: 106, Positive conditional cache size: 0, Positive unconditional cache size: 106, Negative cache size: 16, Negative conditional cache size: 0, Negative unconditional cache size: 16 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L710] 0 _Bool main$tmp_guard0; [L711] 0 _Bool main$tmp_guard1; [L713] 0 int x = 0; [L715] 0 int y = 0; [L716] 0 _Bool y$flush_delayed; [L717] 0 int y$mem_tmp; [L718] 0 _Bool y$r_buff0_thd0; [L719] 0 _Bool y$r_buff0_thd1; [L720] 0 _Bool y$r_buff0_thd2; [L721] 0 _Bool y$r_buff0_thd3; [L722] 0 _Bool y$r_buff1_thd0; [L723] 0 _Bool y$r_buff1_thd1; [L724] 0 _Bool y$r_buff1_thd2; [L725] 0 _Bool y$r_buff1_thd3; [L726] 0 _Bool y$read_delayed; [L727] 0 int *y$read_delayed_var; [L728] 0 int y$w_buff0; [L729] 0 _Bool y$w_buff0_used; [L730] 0 int y$w_buff1; [L731] 0 _Bool y$w_buff1_used; [L733] 0 int z = 0; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L811] 0 pthread_t t2492; [L812] FCALL, FORK 0 pthread_create(&t2492, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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=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, z=0] [L813] 0 pthread_t t2493; [L814] FCALL, FORK 0 pthread_create(&t2493, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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=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, z=0] [L815] 0 pthread_t t2494; [L816] FCALL, FORK 0 pthread_create(&t2494, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=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=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, z=0] [L774] 3 y$w_buff1 = y$w_buff0 [L775] 3 y$w_buff0 = 2 [L776] 3 y$w_buff1_used = y$w_buff0_used [L777] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L779] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L780] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L781] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L782] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L783] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=0] [L786] 3 z = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=1] [L739] 1 z = 2 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L742] 1 x = 1 VAL [__unbuffered_cnt=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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L754] 2 x = 2 VAL [__unbuffered_cnt=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=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=1, 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, z=2] [L747] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L749] 1 return 0; [L757] 2 y = 1 VAL [\result={0:0}, __unbuffered_cnt=1, 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=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] [L789] 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) [L789] 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) [L790] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L790] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L791] 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 [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L792] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L793] 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 [L796] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L798] 3 return 0; [L760] 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) [L760] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L760] 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) [L760] 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) [L761] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L761] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L762] 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 [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L763] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L764] 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 [L767] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L769] 2 return 0; [L818] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, 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=1, 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, z=2] [L3] COND FALSE 0 !(!cond) [L822] 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) [L822] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L822] 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) [L822] 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) [L823] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 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 [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L825] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L826] 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 [L829] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L830] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L831] 0 y$flush_delayed = weak$$choice2 [L832] 0 y$mem_tmp = y [L833] 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) [L833] 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) [L834] 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)) [L834] 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)) [L835] 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)) [L835] 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)) [L836] 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)) [L836] 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)) [L837] 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)) [L837] 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)) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2) [L841] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L841] 0 y = y$flush_delayed ? y$mem_tmp : y [L842] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, 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, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 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. - UnprovableResult [Line: 812]: 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: 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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8846.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 17.7ms, AutomataDifference: 667.7ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6735.6ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 355 SDtfs, 488 SDslu, 576 SDs, 0 SdLazy, 248 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 289.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 287.2ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=690occurred in iteration=0, InterpolantAutomatonStates: 72, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 153.0ms AutomataMinimizationTime, 13 MinimizatonAttempts, 190 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.5ms SsaConstructionTime, 308.9ms SatisfiabilityAnalysisTime, 700.5ms InterpolantComputationTime, 191 NumberOfCodeBlocks, 191 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 157 ConstructedInterpolants, 0 QuantifiedInterpolants, 962 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-09-22 14:52:31,819 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...