./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8c2bbc92 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c -s /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-2/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 1e13d84879e77fc32b246841fb5bbfb65333001d ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.2.1-dev-8c2bbc9 [2021-10-05 21:01:15,162 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-05 21:01:15,166 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-05 21:01:15,222 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-05 21:01:15,223 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-05 21:01:15,228 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-05 21:01:15,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-05 21:01:15,235 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-05 21:01:15,240 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-05 21:01:15,248 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-05 21:01:15,249 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-05 21:01:15,256 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-05 21:01:15,256 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-05 21:01:15,259 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-05 21:01:15,262 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-05 21:01:15,268 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-05 21:01:15,269 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-05 21:01:15,270 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-05 21:01:15,274 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-05 21:01:15,281 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-05 21:01:15,286 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-05 21:01:15,287 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-05 21:01:15,288 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-05 21:01:15,290 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-05 21:01:15,295 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-05 21:01:15,299 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-05 21:01:15,299 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-05 21:01:15,300 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-05 21:01:15,302 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-05 21:01:15,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-05 21:01:15,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-05 21:01:15,305 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-05 21:01:15,310 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-05 21:01:15,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-05 21:01:15,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-05 21:01:15,314 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-05 21:01:15,315 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-05 21:01:15,315 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-05 21:01:15,316 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-05 21:01:15,318 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-05 21:01:15,319 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-05 21:01:15,320 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-10-05 21:01:15,367 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-05 21:01:15,367 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-05 21:01:15,368 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-10-05 21:01:15,369 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-10-05 21:01:15,372 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-05 21:01:15,372 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-05 21:01:15,372 INFO L138 SettingsManager]: * Use SBE=true [2021-10-05 21:01:15,372 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-05 21:01:15,373 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-05 21:01:15,373 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-05 21:01:15,374 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-05 21:01:15,375 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-05 21:01:15,375 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-05 21:01:15,375 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-05 21:01:15,375 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-05 21:01:15,375 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-05 21:01:15,376 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-05 21:01:15,376 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-05 21:01:15,376 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-05 21:01:15,376 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-05 21:01:15,377 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-10-05 21:01:15,377 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-05 21:01:15,377 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:01:15,378 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-05 21:01:15,378 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-05 21:01:15,378 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-05 21:01:15,378 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-10-05 21:01:15,378 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-05 21:01:15,379 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-05 21:01:15,379 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-05 21:01:15,379 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-2/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-2/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 -> 1e13d84879e77fc32b246841fb5bbfb65333001d [2021-10-05 21:01:15,814 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-05 21:01:15,846 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-05 21:01:15,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-05 21:01:15,851 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-05 21:01:15,851 INFO L275 PluginConnector]: CDTParser initialized [2021-10-05 21:01:15,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c [2021-10-05 21:01:15,937 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d6e19730a/52774c05c6e346c1a255b1e396d4d111/FLAG42b6ac7be [2021-10-05 21:01:16,579 INFO L306 CDTParser]: Found 1 translation units. [2021-10-05 21:01:16,581 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c [2021-10-05 21:01:16,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d6e19730a/52774c05c6e346c1a255b1e396d4d111/FLAG42b6ac7be [2021-10-05 21:01:16,907 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/d6e19730a/52774c05c6e346c1a255b1e396d4d111 [2021-10-05 21:01:16,910 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-05 21:01:16,917 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-05 21:01:16,919 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-05 21:01:16,920 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-05 21:01:16,924 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-05 21:01:16,924 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:01:16" (1/1) ... [2021-10-05 21:01:16,926 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c9635ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:16, skipping insertion in model container [2021-10-05 21:01:16,926 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.10 09:01:16" (1/1) ... [2021-10-05 21:01:16,934 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-05 21:01:16,953 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-05 21:01:17,163 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c[2476,2489] [2021-10-05 21:01:17,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:01:17,176 INFO L203 MainTranslator]: Completed pre-run [2021-10-05 21:01:17,202 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-2/releaseScripts/default/sv-benchmarks/c/weaver/parallel/bakery-2.wvr.c[2476,2489] [2021-10-05 21:01:17,203 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-05 21:01:17,219 INFO L208 MainTranslator]: Completed translation [2021-10-05 21:01:17,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17 WrapperNode [2021-10-05 21:01:17,220 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-05 21:01:17,221 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-05 21:01:17,221 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-05 21:01:17,221 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-05 21:01:17,230 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,238 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-05 21:01:17,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-05 21:01:17,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-05 21:01:17,275 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-05 21:01:17,285 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,285 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,288 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,289 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,294 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,297 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,298 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,302 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-05 21:01:17,303 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-05 21:01:17,303 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-05 21:01:17,303 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-05 21:01:17,304 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (1/1) ... [2021-10-05 21:01:17,313 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-05 21:01:17,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 [2021-10-05 21:01:17,342 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-05 21:01:17,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-05 21:01:17,421 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2021-10-05 21:01:17,421 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2021-10-05 21:01:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2021-10-05 21:01:17,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2021-10-05 21:01:17,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-05 21:01:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-05 21:01:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-05 21:01:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-05 21:01:17,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-05 21:01:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-05 21:01:17,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-05 21:01:17,427 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-10-05 21:01:17,813 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-05 21:01:17,813 INFO L299 CfgBuilder]: Removed 16 assume(true) statements. [2021-10-05 21:01:17,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:01:17 BoogieIcfgContainer [2021-10-05 21:01:17,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-05 21:01:17,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-05 21:01:17,818 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-05 21:01:17,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-05 21:01:17,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.10 09:01:16" (1/3) ... [2021-10-05 21:01:17,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617f12ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:01:17, skipping insertion in model container [2021-10-05 21:01:17,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.10 09:01:17" (2/3) ... [2021-10-05 21:01:17,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@617f12ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.10 09:01:17, skipping insertion in model container [2021-10-05 21:01:17,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:01:17" (3/3) ... [2021-10-05 21:01:17,825 INFO L111 eAbstractionObserver]: Analyzing ICFG bakery-2.wvr.c [2021-10-05 21:01:17,831 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-10-05 21:01:17,831 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-05 21:01:17,832 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-10-05 21:01:17,832 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-10-05 21:01:17,869 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,869 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,869 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,870 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,870 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,870 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,870 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,871 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,872 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,873 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,873 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,873 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,873 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,874 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,874 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,874 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,874 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,874 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,875 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,875 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,875 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,875 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,876 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,876 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,876 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,876 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,877 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,877 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,878 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,878 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,878 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,879 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,879 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,880 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,881 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,882 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,883 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,884 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,884 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,885 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,885 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,885 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,885 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,886 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,886 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,886 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,886 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,887 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,887 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,887 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,887 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,888 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,888 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,888 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,888 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,889 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,889 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,889 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,889 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,890 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,896 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,896 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,897 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,901 WARN L313 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork0_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,901 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,901 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,901 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,902 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,902 WARN L313 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,907 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,907 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,908 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,908 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_assume_abort_if_not_#in~cond| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,908 WARN L313 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork1_#t~post6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,908 WARN L313 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork1_assume_abort_if_not_~cond not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-10-05 21:01:17,917 INFO L148 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2021-10-05 21:01:17,975 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-05 21:01:17,984 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-10-05 21:01:17,985 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2021-10-05 21:01:18,010 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-10-05 21:01:18,033 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 130 places, 131 transitions, 278 flow [2021-10-05 21:01:18,037 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 130 places, 131 transitions, 278 flow [2021-10-05 21:01:18,042 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 130 places, 131 transitions, 278 flow [2021-10-05 21:01:18,227 INFO L129 PetriNetUnfolder]: 8/129 cut-off events. [2021-10-05 21:01:18,230 INFO L130 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2021-10-05 21:01:18,246 INFO L84 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 129 events. 8/129 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 95 event pairs, 0 based on Foata normal form. 0/120 useless extension candidates. Maximal degree in co-relation 81. Up to 2 conditions per place. [2021-10-05 21:01:18,255 INFO L116 LiptonReduction]: Number of co-enabled transitions 2408 [2021-10-05 21:01:22,816 INFO L131 LiptonReduction]: Checked pairs total: 8522 [2021-10-05 21:01:22,817 INFO L133 LiptonReduction]: Total number of compositions: 118 [2021-10-05 21:01:22,828 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 43 places, 41 transitions, 98 flow [2021-10-05 21:01:22,880 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 394 states, 393 states have (on average 2.6386768447837152) internal successors, (1037), 393 states have internal predecessors, (1037), 0 states have call successors, (0), 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-10-05 21:01:22,885 INFO L276 IsEmpty]: Start isEmpty. Operand has 394 states, 393 states have (on average 2.6386768447837152) internal successors, (1037), 393 states have internal predecessors, (1037), 0 states have call successors, (0), 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-10-05 21:01:22,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-05 21:01:22,903 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:22,904 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] [2021-10-05 21:01:22,905 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:22,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:22,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1847479416, now seen corresponding path program 1 times [2021-10-05 21:01:22,923 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:22,923 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980283908] [2021-10-05 21:01:22,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:22,925 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:23,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:23,194 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:23,196 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980283908] [2021-10-05 21:01:23,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980283908] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:23,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:23,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-05 21:01:23,200 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868403796] [2021-10-05 21:01:23,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-10-05 21:01:23,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:23,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-10-05 21:01:23,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:01:23,242 INFO L87 Difference]: Start difference. First operand has 394 states, 393 states have (on average 2.6386768447837152) internal successors, (1037), 393 states have internal predecessors, (1037), 0 states have call successors, (0), 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 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-05 21:01:23,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:23,282 INFO L93 Difference]: Finished difference Result 394 states and 953 transitions. [2021-10-05 21:01:23,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-10-05 21:01:23,284 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2021-10-05 21:01:23,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:23,307 INFO L225 Difference]: With dead ends: 394 [2021-10-05 21:01:23,307 INFO L226 Difference]: Without dead ends: 394 [2021-10-05 21:01:23,309 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0ms TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-10-05 21:01:23,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2021-10-05 21:01:23,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2021-10-05 21:01:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 393 states have (on average 2.4249363867684477) internal successors, (953), 393 states have internal predecessors, (953), 0 states have call successors, (0), 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-10-05 21:01:23,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 953 transitions. [2021-10-05 21:01:23,417 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 953 transitions. Word has length 20 [2021-10-05 21:01:23,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:23,417 INFO L470 AbstractCegarLoop]: Abstraction has 394 states and 953 transitions. [2021-10-05 21:01:23,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.0) internal successors, (20), 2 states have internal predecessors, (20), 0 states have call successors, (0), 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-10-05 21:01:23,418 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 953 transitions. [2021-10-05 21:01:23,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-05 21:01:23,432 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:23,432 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:23,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-05 21:01:23,433 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:23,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:23,434 INFO L82 PathProgramCache]: Analyzing trace with hash -1726795706, now seen corresponding path program 1 times [2021-10-05 21:01:23,434 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:23,435 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890793133] [2021-10-05 21:01:23,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:23,435 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:23,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:23,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:23,658 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:23,658 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890793133] [2021-10-05 21:01:23,659 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890793133] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:23,659 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:23,659 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 21:01:23,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722116014] [2021-10-05 21:01:23,665 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 21:01:23,667 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:23,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 21:01:23,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-05 21:01:23,671 INFO L87 Difference]: Start difference. First operand 394 states and 953 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:23,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:23,795 INFO L93 Difference]: Finished difference Result 550 states and 1296 transitions. [2021-10-05 21:01:23,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-05 21:01:23,796 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-05 21:01:23,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:23,807 INFO L225 Difference]: With dead ends: 550 [2021-10-05 21:01:23,808 INFO L226 Difference]: Without dead ends: 550 [2021-10-05 21:01:23,809 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.6ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-10-05 21:01:23,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2021-10-05 21:01:23,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 358. [2021-10-05 21:01:23,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 357 states have (on average 2.3417366946778713) internal successors, (836), 357 states have internal predecessors, (836), 0 states have call successors, (0), 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-10-05 21:01:23,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 836 transitions. [2021-10-05 21:01:23,880 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 836 transitions. Word has length 27 [2021-10-05 21:01:23,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:23,881 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 836 transitions. [2021-10-05 21:01:23,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:23,882 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 836 transitions. [2021-10-05 21:01:23,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-05 21:01:23,888 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:23,888 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:23,889 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-05 21:01:23,891 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:23,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:23,892 INFO L82 PathProgramCache]: Analyzing trace with hash -1693695208, now seen corresponding path program 2 times [2021-10-05 21:01:23,892 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:23,892 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665544716] [2021-10-05 21:01:23,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:23,893 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:24,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:24,084 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:24,085 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665544716] [2021-10-05 21:01:24,087 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665544716] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:24,087 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:24,087 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-05 21:01:24,088 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864915338] [2021-10-05 21:01:24,089 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:01:24,089 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:24,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:01:24,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:01:24,090 INFO L87 Difference]: Start difference. First operand 358 states and 836 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:24,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:24,187 INFO L93 Difference]: Finished difference Result 409 states and 915 transitions. [2021-10-05 21:01:24,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 21:01:24,192 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-05 21:01:24,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:24,195 INFO L225 Difference]: With dead ends: 409 [2021-10-05 21:01:24,195 INFO L226 Difference]: Without dead ends: 326 [2021-10-05 21:01:24,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 54.5ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:01:24,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2021-10-05 21:01:24,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 294. [2021-10-05 21:01:24,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 293 states have (on average 2.3344709897610922) internal successors, (684), 293 states have internal predecessors, (684), 0 states have call successors, (0), 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-10-05 21:01:24,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 684 transitions. [2021-10-05 21:01:24,224 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 684 transitions. Word has length 27 [2021-10-05 21:01:24,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:24,225 INFO L470 AbstractCegarLoop]: Abstraction has 294 states and 684 transitions. [2021-10-05 21:01:24,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:24,225 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 684 transitions. [2021-10-05 21:01:24,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-05 21:01:24,228 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:24,228 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:24,229 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-05 21:01:24,229 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:24,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:24,231 INFO L82 PathProgramCache]: Analyzing trace with hash 1936090994, now seen corresponding path program 3 times [2021-10-05 21:01:24,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:24,232 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748231341] [2021-10-05 21:01:24,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:24,232 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:24,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:24,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:24,448 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748231341] [2021-10-05 21:01:24,448 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748231341] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:24,449 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:24,450 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:01:24,451 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156435629] [2021-10-05 21:01:24,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:01:24,452 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:24,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:01:24,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:01:24,455 INFO L87 Difference]: Start difference. First operand 294 states and 684 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:24,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:24,577 INFO L93 Difference]: Finished difference Result 362 states and 790 transitions. [2021-10-05 21:01:24,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 21:01:24,578 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-05 21:01:24,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:24,581 INFO L225 Difference]: With dead ends: 362 [2021-10-05 21:01:24,581 INFO L226 Difference]: Without dead ends: 322 [2021-10-05 21:01:24,582 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 56.7ms TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:01:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2021-10-05 21:01:24,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 270. [2021-10-05 21:01:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 269 states have (on average 2.2156133828996283) internal successors, (596), 269 states have internal predecessors, (596), 0 states have call successors, (0), 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-10-05 21:01:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 596 transitions. [2021-10-05 21:01:24,596 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 596 transitions. Word has length 27 [2021-10-05 21:01:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:24,596 INFO L470 AbstractCegarLoop]: Abstraction has 270 states and 596 transitions. [2021-10-05 21:01:24,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 596 transitions. [2021-10-05 21:01:24,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-05 21:01:24,598 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:24,599 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:24,599 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-05 21:01:24,599 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:24,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:24,601 INFO L82 PathProgramCache]: Analyzing trace with hash -952228366, now seen corresponding path program 4 times [2021-10-05 21:01:24,601 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:24,602 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006661944] [2021-10-05 21:01:24,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:24,602 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:24,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:24,720 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:24,720 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006661944] [2021-10-05 21:01:24,721 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006661944] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:24,721 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:24,721 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-05 21:01:24,722 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144159161] [2021-10-05 21:01:24,722 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-05 21:01:24,722 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:24,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-05 21:01:24,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-05 21:01:24,724 INFO L87 Difference]: Start difference. First operand 270 states and 596 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:24,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:24,746 INFO L93 Difference]: Finished difference Result 282 states and 604 transitions. [2021-10-05 21:01:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-05 21:01:24,747 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-05 21:01:24,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:24,750 INFO L225 Difference]: With dead ends: 282 [2021-10-05 21:01:24,750 INFO L226 Difference]: Without dead ends: 258 [2021-10-05 21:01:24,751 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-05 21:01:24,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2021-10-05 21:01:24,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2021-10-05 21:01:24,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 257 states have (on average 2.178988326848249) internal successors, (560), 257 states have internal predecessors, (560), 0 states have call successors, (0), 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-10-05 21:01:24,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 560 transitions. [2021-10-05 21:01:24,762 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 560 transitions. Word has length 27 [2021-10-05 21:01:24,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:24,762 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 560 transitions. [2021-10-05 21:01:24,767 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:24,767 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 560 transitions. [2021-10-05 21:01:24,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-05 21:01:24,770 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:24,770 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:24,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-05 21:01:24,771 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:24,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:24,771 INFO L82 PathProgramCache]: Analyzing trace with hash -966731608, now seen corresponding path program 5 times [2021-10-05 21:01:24,772 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:24,772 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726149054] [2021-10-05 21:01:24,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:24,772 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:24,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:24,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:24,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:24,936 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726149054] [2021-10-05 21:01:24,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726149054] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:24,936 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:24,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:01:24,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404864709] [2021-10-05 21:01:24,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:01:24,938 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:24,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:01:24,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:01:24,939 INFO L87 Difference]: Start difference. First operand 258 states and 560 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:25,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:25,037 INFO L93 Difference]: Finished difference Result 312 states and 655 transitions. [2021-10-05 21:01:25,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 21:01:25,038 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-05 21:01:25,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:25,041 INFO L225 Difference]: With dead ends: 312 [2021-10-05 21:01:25,044 INFO L226 Difference]: Without dead ends: 264 [2021-10-05 21:01:25,044 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 35.1ms TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2021-10-05 21:01:25,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2021-10-05 21:01:25,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 246. [2021-10-05 21:01:25,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 245 states have (on average 2.163265306122449) internal successors, (530), 245 states have internal predecessors, (530), 0 states have call successors, (0), 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-10-05 21:01:25,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 530 transitions. [2021-10-05 21:01:25,054 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 530 transitions. Word has length 27 [2021-10-05 21:01:25,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:25,054 INFO L470 AbstractCegarLoop]: Abstraction has 246 states and 530 transitions. [2021-10-05 21:01:25,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:25,056 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 530 transitions. [2021-10-05 21:01:25,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-05 21:01:25,059 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:25,059 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:25,060 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-05 21:01:25,060 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:25,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:25,061 INFO L82 PathProgramCache]: Analyzing trace with hash -103086242, now seen corresponding path program 6 times [2021-10-05 21:01:25,061 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:25,062 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300139279] [2021-10-05 21:01:25,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:25,062 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:25,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:25,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:25,193 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300139279] [2021-10-05 21:01:25,193 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300139279] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:25,193 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:25,194 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-05 21:01:25,194 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258905006] [2021-10-05 21:01:25,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-10-05 21:01:25,194 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:25,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-10-05 21:01:25,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-10-05 21:01:25,199 INFO L87 Difference]: Start difference. First operand 246 states and 530 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:25,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:25,261 INFO L93 Difference]: Finished difference Result 277 states and 577 transitions. [2021-10-05 21:01:25,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-10-05 21:01:25,262 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2021-10-05 21:01:25,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:25,264 INFO L225 Difference]: With dead ends: 277 [2021-10-05 21:01:25,264 INFO L226 Difference]: Without dead ends: 222 [2021-10-05 21:01:25,264 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 45.2ms TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2021-10-05 21:01:25,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2021-10-05 21:01:25,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 208. [2021-10-05 21:01:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 207 states have (on average 2.111111111111111) internal successors, (437), 207 states have internal predecessors, (437), 0 states have call successors, (0), 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-10-05 21:01:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 437 transitions. [2021-10-05 21:01:25,273 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 437 transitions. Word has length 27 [2021-10-05 21:01:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:25,274 INFO L470 AbstractCegarLoop]: Abstraction has 208 states and 437 transitions. [2021-10-05 21:01:25,274 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 0 states have call successors, (0), 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-10-05 21:01:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 437 transitions. [2021-10-05 21:01:25,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:01:25,275 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:25,275 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:25,275 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-05 21:01:25,276 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:25,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:25,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1499055774, now seen corresponding path program 1 times [2021-10-05 21:01:25,276 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:25,277 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905841094] [2021-10-05 21:01:25,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:25,277 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:25,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:25,386 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:25,386 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:25,387 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905841094] [2021-10-05 21:01:25,387 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905841094] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:25,387 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:25,387 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:01:25,387 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119071576] [2021-10-05 21:01:25,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:01:25,388 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:25,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:01:25,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:01:25,389 INFO L87 Difference]: Start difference. First operand 208 states and 437 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-05 21:01:25,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:25,490 INFO L93 Difference]: Finished difference Result 244 states and 509 transitions. [2021-10-05 21:01:25,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-05 21:01:25,491 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-05 21:01:25,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:25,492 INFO L225 Difference]: With dead ends: 244 [2021-10-05 21:01:25,492 INFO L226 Difference]: Without dead ends: 142 [2021-10-05 21:01:25,493 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 65.0ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:01:25,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2021-10-05 21:01:25,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2021-10-05 21:01:25,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 141 states have (on average 2.028368794326241) internal successors, (286), 141 states have internal predecessors, (286), 0 states have call successors, (0), 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-10-05 21:01:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 286 transitions. [2021-10-05 21:01:25,499 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 286 transitions. Word has length 29 [2021-10-05 21:01:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:25,499 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 286 transitions. [2021-10-05 21:01:25,499 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-05 21:01:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 286 transitions. [2021-10-05 21:01:25,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-05 21:01:25,500 INFO L504 BasicCegarLoop]: Found error trace [2021-10-05 21:01:25,500 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-05 21:01:25,501 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-05 21:01:25,501 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION] === [2021-10-05 21:01:25,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-05 21:01:25,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1136905868, now seen corresponding path program 1 times [2021-10-05 21:01:25,502 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-10-05 21:01:25,502 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609643615] [2021-10-05 21:01:25,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-05 21:01:25,503 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-05 21:01:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-05 21:01:25,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-05 21:01:25,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-10-05 21:01:25,603 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609643615] [2021-10-05 21:01:25,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1609643615] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-05 21:01:25,603 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-05 21:01:25,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-05 21:01:25,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718504689] [2021-10-05 21:01:25,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-10-05 21:01:25,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-10-05 21:01:25,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-05 21:01:25,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-10-05 21:01:25,605 INFO L87 Difference]: Start difference. First operand 142 states and 286 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-05 21:01:25,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-05 21:01:25,682 INFO L93 Difference]: Finished difference Result 108 states and 219 transitions. [2021-10-05 21:01:25,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-10-05 21:01:25,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 29 [2021-10-05 21:01:25,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-05 21:01:25,683 INFO L225 Difference]: With dead ends: 108 [2021-10-05 21:01:25,683 INFO L226 Difference]: Without dead ends: 0 [2021-10-05 21:01:25,684 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 51.4ms TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2021-10-05 21:01:25,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-10-05 21:01:25,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-10-05 21:01:25,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-10-05 21:01:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-10-05 21:01:25,685 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2021-10-05 21:01:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-05 21:01:25,685 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-10-05 21:01:25,685 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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-10-05 21:01:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-10-05 21:01:25,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-10-05 21:01:25,689 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-10-05 21:01:25,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATION [2021-10-05 21:01:25,690 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATION [2021-10-05 21:01:25,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-05 21:01:25,696 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-10-05 21:01:25,696 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-05 21:01:25,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.10 09:01:25 BasicIcfg [2021-10-05 21:01:25,699 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-05 21:01:25,700 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-05 21:01:25,700 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-05 21:01:25,700 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-05 21:01:25,701 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.10 09:01:17" (3/4) ... [2021-10-05 21:01:25,705 INFO L137 WitnessPrinter]: Generating witness for correct program [2021-10-05 21:01:25,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2021-10-05 21:01:25,713 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2021-10-05 21:01:25,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2021-10-05 21:01:25,719 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2021-10-05 21:01:25,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2021-10-05 21:01:25,720 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2021-10-05 21:01:25,763 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-10-05 21:01:25,764 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-05 21:01:25,766 INFO L168 Benchmark]: Toolchain (without parser) took 8852.87 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 30.7 MB in the beginning and 64.7 MB in the end (delta: -34.0 MB). Peak memory consumption was 12.2 MB. Max. memory is 16.1 GB. [2021-10-05 21:01:25,766 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 21.4 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:01:25,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 300.89 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 33.2 MB in the end (delta: -2.8 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. [2021-10-05 21:01:25,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 53.21 ms. Allocated memory is still 54.5 MB. Free memory was 33.2 MB in the beginning and 31.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-05 21:01:25,768 INFO L168 Benchmark]: Boogie Preprocessor took 26.93 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 30.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:01:25,768 INFO L168 Benchmark]: RCFGBuilder took 512.84 ms. Allocated memory is still 54.5 MB. Free memory was 30.1 MB in the beginning and 30.6 MB in the end (delta: -445.4 kB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:01:25,769 INFO L168 Benchmark]: TraceAbstraction took 7881.60 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 30.2 MB in the beginning and 67.7 MB in the end (delta: -37.6 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. [2021-10-05 21:01:25,770 INFO L168 Benchmark]: Witness Printer took 64.15 ms. Allocated memory is still 98.6 MB. Free memory was 67.7 MB in the beginning and 64.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-05 21:01:25,773 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.23 ms. Allocated memory is still 44.0 MB. Free memory was 21.4 MB in the beginning and 21.4 MB in the end (delta: 31.8 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 300.89 ms. Allocated memory is still 54.5 MB. Free memory was 30.4 MB in the beginning and 33.2 MB in the end (delta: -2.8 MB). Peak memory consumption was 7.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 53.21 ms. Allocated memory is still 54.5 MB. Free memory was 33.2 MB in the beginning and 31.5 MB in the end (delta: 1.7 MB). There was no memory consumed. Max. memory is 16.1 GB. * Boogie Preprocessor took 26.93 ms. Allocated memory is still 54.5 MB. Free memory was 31.4 MB in the beginning and 30.3 MB in the end (delta: 1.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 512.84 ms. Allocated memory is still 54.5 MB. Free memory was 30.1 MB in the beginning and 30.6 MB in the end (delta: -445.4 kB). Peak memory consumption was 8.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 7881.60 ms. Allocated memory was 54.5 MB in the beginning and 98.6 MB in the end (delta: 44.0 MB). Free memory was 30.2 MB in the beginning and 67.7 MB in the end (delta: -37.6 MB). Peak memory consumption was 7.0 MB. Max. memory is 16.1 GB. * Witness Printer took 64.15 ms. Allocated memory is still 98.6 MB. Free memory was 67.7 MB in the beginning and 64.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 4780.7ms, 130 PlacesBefore, 43 PlacesAfterwards, 131 TransitionsBefore, 41 TransitionsAfterwards, 2408 CoEnabledTransitionPairs, 7 FixpointIterations, 58 TrivialSequentialCompositions, 33 ConcurrentSequentialCompositions, 2 TrivialYvCompositions, 22 ConcurrentYvCompositions, 3 ChoiceCompositions, 118 TotalNumberOfCompositions, 8522 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4686, positive: 4374, positive conditional: 0, positive unconditional: 4374, negative: 312, negative conditional: 0, negative unconditional: 312, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 2002, positive: 1935, positive conditional: 0, positive unconditional: 1935, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 2002, positive: 1899, positive conditional: 0, positive unconditional: 1899, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 103, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 67, negative conditional: 0, negative unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 173, positive: 46, positive conditional: 0, positive unconditional: 46, negative: 126, negative conditional: 0, negative unconditional: 126, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 4686, positive: 2439, positive conditional: 0, positive unconditional: 2439, negative: 245, negative conditional: 0, negative unconditional: 245, unknown: 2002, unknown conditional: 0, unknown unconditional: 2002] , Statistics on independence cache: Total cache size (in pairs): 363, Positive cache size: 324, Positive conditional cache size: 0, Positive unconditional cache size: 324, Negative cache size: 39, Negative conditional cache size: 0, Negative unconditional cache size: 39 - 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 - PositiveResult [Line: 94]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 178 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 7722.3ms, OverallIterations: 9, TraceHistogramMax: 1, EmptinessCheckTime: 54.6ms, AutomataDifference: 864.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4895.7ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 446 SDtfs, 464 SDslu, 1041 SDs, 0 SdLazy, 497 SolverSat, 45 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 354.5ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 325.1ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=394occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 233.6ms AutomataMinimizationTime, 9 MinimizatonAttempts, 308 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 57.5ms SsaConstructionTime, 484.8ms SatisfiabilityAnalysisTime, 848.1ms InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 849 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2021-10-05 21:01:25,817 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...