./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c88a7004d637e9a93226ab5afffb63cbef8fe722 .............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 22:22:50,653 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 22:22:50,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 22:22:50,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 22:22:50,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 22:22:50,698 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 22:22:50,699 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 22:22:50,703 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 22:22:50,704 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 22:22:50,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 22:22:50,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 22:22:50,711 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 22:22:50,711 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 22:22:50,713 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 22:22:50,714 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 22:22:50,718 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 22:22:50,719 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 22:22:50,719 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 22:22:50,721 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 22:22:50,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 22:22:50,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 22:22:50,726 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 22:22:50,727 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 22:22:50,728 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 22:22:50,733 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 22:22:50,733 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 22:22:50,733 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 22:22:50,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 22:22:50,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 22:22:50,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 22:22:50,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 22:22:50,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 22:22:50,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 22:22:50,737 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 22:22:50,738 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 22:22:50,738 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 22:22:50,739 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 22:22:50,739 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 22:22:50,739 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 22:22:50,740 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 22:22:50,741 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 22:22:50,744 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 22:22:50,771 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 22:22:50,772 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 22:22:50,772 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 22:22:50,773 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 22:22:50,774 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 22:22:50,774 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 22:22:50,774 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 22:22:50,774 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 22:22:50,775 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 22:22:50,775 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 22:22:50,775 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 22:22:50,776 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 22:22:50,777 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 22:22:50,777 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 22:22:50,777 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 22:22:50,777 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:22:50,777 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 22:22:50,777 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 22:22:50,777 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 22:22:50,778 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 22:22:50,778 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 22:22:50,778 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 22:22:50,778 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 22:22:50,778 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c88a7004d637e9a93226ab5afffb63cbef8fe722 [2021-08-29 22:22:51,024 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 22:22:51,036 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 22:22:51,038 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 22:22:51,038 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 22:22:51,039 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 22:22:51,040 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i [2021-08-29 22:22:51,089 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38cb04cd7/8ab80313fa994e1481fbf4a453fafdb4/FLAG138b1bef9 [2021-08-29 22:22:51,440 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 22:22:51,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i [2021-08-29 22:22:51,454 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38cb04cd7/8ab80313fa994e1481fbf4a453fafdb4/FLAG138b1bef9 [2021-08-29 22:22:51,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38cb04cd7/8ab80313fa994e1481fbf4a453fafdb4 [2021-08-29 22:22:51,826 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 22:22:51,827 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 22:22:51,828 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 22:22:51,828 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 22:22:51,830 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 22:22:51,831 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:22:51" (1/1) ... [2021-08-29 22:22:51,832 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7362ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:51, skipping insertion in model container [2021-08-29 22:22:51,832 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:22:51" (1/1) ... [2021-08-29 22:22:51,839 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 22:22:51,871 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 22:22:51,977 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i[949,962] [2021-08-29 22:22:52,167 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:22:52,183 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 22:22:52,193 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i[949,962] [2021-08-29 22:22:52,247 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:22:52,278 INFO L208 MainTranslator]: Completed translation [2021-08-29 22:22:52,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52 WrapperNode [2021-08-29 22:22:52,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 22:22:52,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 22:22:52,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 22:22:52,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 22:22:52,286 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,311 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,345 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 22:22:52,346 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 22:22:52,347 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 22:22:52,347 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 22:22:52,352 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,365 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,373 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,385 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,387 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,389 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 22:22:52,394 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 22:22:52,394 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 22:22:52,394 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 22:22:52,395 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (1/1) ... [2021-08-29 22:22:52,400 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:22:52,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 22:22:52,419 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 22:22:52,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 22:22:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 22:22:52,492 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-29 22:22:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 22:22:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 22:22:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-29 22:22:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-29 22:22:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-29 22:22:52,493 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-29 22:22:52,493 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-29 22:22:52,494 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-29 22:22:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 22:22:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-29 22:22:52,494 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 22:22:52,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 22:22:52,495 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-29 22:22:53,062 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 22:22:53,063 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-29 22:22:53,066 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:22:53 BoogieIcfgContainer [2021-08-29 22:22:53,066 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 22:22:53,067 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 22:22:53,067 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 22:22:53,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 22:22:53,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:22:51" (1/3) ... [2021-08-29 22:22:53,069 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1b4e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:22:53, skipping insertion in model container [2021-08-29 22:22:53,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:22:52" (2/3) ... [2021-08-29 22:22:53,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1b4e25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:22:53, skipping insertion in model container [2021-08-29 22:22:53,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:22:53" (3/3) ... [2021-08-29 22:22:53,071 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2021-08-29 22:22:53,075 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 22:22:53,075 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 22:22:53,075 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 22:22:53,075 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 22:22:53,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,107 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,107 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,107 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,108 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,108 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,109 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,109 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,109 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,109 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,110 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,111 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,112 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,113 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,114 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,115 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,115 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,116 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,117 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,118 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,119 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,119 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,120 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,121 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,122 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,123 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,124 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,130 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,131 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,131 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,133 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,134 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,135 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,136 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,136 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,140 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,140 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,141 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,141 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,142 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,143 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,143 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:22:53,143 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-29 22:22:53,172 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 22:22:53,177 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 22:22:53,177 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-29 22:22:53,184 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 22:22:53,191 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 223 flow [2021-08-29 22:22:53,193 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 223 flow [2021-08-29 22:22:53,194 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-08-29 22:22:53,221 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-08-29 22:22:53,221 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-29 22:22:53,223 INFO L84 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 101 events. 2/101 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 51 event pairs, 0 based on Foata normal form. 0/97 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2021-08-29 22:22:53,225 INFO L116 LiptonReduction]: Number of co-enabled transitions 1776 [2021-08-29 22:23:08,524 INFO L131 LiptonReduction]: Checked pairs total: 3997 [2021-08-29 22:23:08,525 INFO L133 LiptonReduction]: Total number of compositions: 90 [2021-08-29 22:23:08,535 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2021-08-29 22:23:08,606 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 582 states, 579 states have (on average 3.063903281519862) internal successors, (1774), 581 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 582 states, 579 states have (on average 3.063903281519862) internal successors, (1774), 581 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:08,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-08-29 22:23:08,614 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:08,615 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-08-29 22:23:08,616 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:08,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:08,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1079556, now seen corresponding path program 1 times [2021-08-29 22:23:08,627 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:08,628 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595279341] [2021-08-29 22:23:08,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:08,628 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:08,761 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:08,761 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:08,761 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595279341] [2021-08-29 22:23:08,762 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595279341] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:08,762 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:08,762 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:23:08,763 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223561929] [2021-08-29 22:23:08,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:23:08,766 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:08,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:23:08,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:23:08,782 INFO L87 Difference]: Start difference. First operand has 582 states, 579 states have (on average 3.063903281519862) internal successors, (1774), 581 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:08,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:08,863 INFO L93 Difference]: Finished difference Result 472 states and 1413 transitions. [2021-08-29 22:23:08,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:23:08,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-08-29 22:23:08,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:08,877 INFO L225 Difference]: With dead ends: 472 [2021-08-29 22:23:08,877 INFO L226 Difference]: Without dead ends: 452 [2021-08-29 22:23:08,878 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.06ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:23:08,880 INFO L928 BasicCegarLoop]: 9 mSDtfsCounter, 10 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.44ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.63ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.39ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:08,881 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 17 Invalid, 27 Unknown, 0 Unchecked, 0.63ms Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 42.39ms Time] [2021-08-29 22:23:08,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-08-29 22:23:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2021-08-29 22:23:08,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 451 states have (on average 3.0199556541019956) internal successors, (1362), 451 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:08,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2021-08-29 22:23:08,944 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2021-08-29 22:23:08,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:08,944 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2021-08-29 22:23:08,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:08,944 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2021-08-29 22:23:08,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-29 22:23:08,945 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:08,945 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:08,946 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 22:23:08,946 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:08,947 INFO L82 PathProgramCache]: Analyzing trace with hash -375869118, now seen corresponding path program 1 times [2021-08-29 22:23:08,947 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:08,947 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100872353] [2021-08-29 22:23:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:08,948 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:09,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:09,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:09,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:09,042 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100872353] [2021-08-29 22:23:09,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100872353] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:09,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:09,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:23:09,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115320769] [2021-08-29 22:23:09,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:23:09,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:09,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:23:09,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:23:09,045 INFO L87 Difference]: Start difference. First operand 452 states and 1362 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:09,068 INFO L93 Difference]: Finished difference Result 432 states and 1291 transitions. [2021-08-29 22:23:09,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:23:09,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-29 22:23:09,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:09,071 INFO L225 Difference]: With dead ends: 432 [2021-08-29 22:23:09,071 INFO L226 Difference]: Without dead ends: 432 [2021-08-29 22:23:09,071 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.36ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:23:09,072 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 7 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.27ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.91ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:09,073 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.27ms Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 17.91ms Time] [2021-08-29 22:23:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-08-29 22:23:09,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-08-29 22:23:09,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 431 states have (on average 2.9953596287703017) internal successors, (1291), 431 states have internal predecessors, (1291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1291 transitions. [2021-08-29 22:23:09,089 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1291 transitions. Word has length 9 [2021-08-29 22:23:09,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:09,089 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1291 transitions. [2021-08-29 22:23:09,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,090 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1291 transitions. [2021-08-29 22:23:09,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-29 22:23:09,091 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:09,091 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:09,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 22:23:09,091 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:09,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:09,092 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757885, now seen corresponding path program 1 times [2021-08-29 22:23:09,092 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:09,092 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499044490] [2021-08-29 22:23:09,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:09,092 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:09,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:09,160 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:09,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499044490] [2021-08-29 22:23:09,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499044490] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:09,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:09,161 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:23:09,161 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122371266] [2021-08-29 22:23:09,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:23:09,162 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:09,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:23:09,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:09,162 INFO L87 Difference]: Start difference. First operand 432 states and 1291 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:09,206 INFO L93 Difference]: Finished difference Result 640 states and 1891 transitions. [2021-08-29 22:23:09,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:09,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-29 22:23:09,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:09,209 INFO L225 Difference]: With dead ends: 640 [2021-08-29 22:23:09,209 INFO L226 Difference]: Without dead ends: 400 [2021-08-29 22:23:09,209 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.09ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:09,210 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 28.66ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.52ms SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.00ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:09,210 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 26 Invalid, 28 Unknown, 0 Unchecked, 0.52ms Time], IncrementalHoareTripleChecker [2 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 33.00ms Time] [2021-08-29 22:23:09,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-08-29 22:23:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2021-08-29 22:23:09,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 400 states, 399 states have (on average 2.9398496240601504) internal successors, (1173), 399 states have internal predecessors, (1173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1173 transitions. [2021-08-29 22:23:09,219 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1173 transitions. Word has length 10 [2021-08-29 22:23:09,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:09,220 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 1173 transitions. [2021-08-29 22:23:09,220 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,220 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1173 transitions. [2021-08-29 22:23:09,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-29 22:23:09,221 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:09,221 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:09,221 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 22:23:09,222 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:09,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:09,222 INFO L82 PathProgramCache]: Analyzing trace with hash -433012595, now seen corresponding path program 1 times [2021-08-29 22:23:09,222 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:09,222 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086569327] [2021-08-29 22:23:09,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:09,223 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:09,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:09,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:09,299 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086569327] [2021-08-29 22:23:09,299 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086569327] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:09,299 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:09,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:23:09,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611281448] [2021-08-29 22:23:09,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:23:09,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:09,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:23:09,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:09,300 INFO L87 Difference]: Start difference. First operand 400 states and 1173 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:09,355 INFO L93 Difference]: Finished difference Result 396 states and 1157 transitions. [2021-08-29 22:23:09,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:09,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-29 22:23:09,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:09,357 INFO L225 Difference]: With dead ends: 396 [2021-08-29 22:23:09,358 INFO L226 Difference]: Without dead ends: 396 [2021-08-29 22:23:09,366 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.32ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:09,369 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 14 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 44.49ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.46ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 49.94ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:09,369 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 26 Invalid, 34 Unknown, 0 Unchecked, 0.46ms Time], IncrementalHoareTripleChecker [4 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 49.94ms Time] [2021-08-29 22:23:09,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-08-29 22:23:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2021-08-29 22:23:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 395 states have (on average 2.929113924050633) internal successors, (1157), 395 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1157 transitions. [2021-08-29 22:23:09,378 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1157 transitions. Word has length 11 [2021-08-29 22:23:09,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:09,392 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 1157 transitions. [2021-08-29 22:23:09,392 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1157 transitions. [2021-08-29 22:23:09,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 22:23:09,394 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:09,394 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:09,394 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 22:23:09,394 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:09,395 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:09,395 INFO L82 PathProgramCache]: Analyzing trace with hash -538490326, now seen corresponding path program 1 times [2021-08-29 22:23:09,395 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:09,395 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961142541] [2021-08-29 22:23:09,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:09,395 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:09,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:09,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:09,525 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:09,525 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961142541] [2021-08-29 22:23:09,526 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961142541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:09,526 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:09,526 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:23:09,526 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124098795] [2021-08-29 22:23:09,526 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:23:09,526 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:09,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:23:09,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:09,527 INFO L87 Difference]: Start difference. First operand 396 states and 1157 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:09,593 INFO L93 Difference]: Finished difference Result 448 states and 1301 transitions. [2021-08-29 22:23:09,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-29 22:23:09,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:09,596 INFO L225 Difference]: With dead ends: 448 [2021-08-29 22:23:09,596 INFO L226 Difference]: Without dead ends: 448 [2021-08-29 22:23:09,596 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.19ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:09,597 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 13 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 56.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.36ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 61.66ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:09,597 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 21 Invalid, 34 Unknown, 0 Unchecked, 0.36ms Time], IncrementalHoareTripleChecker [5 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 61.66ms Time] [2021-08-29 22:23:09,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-08-29 22:23:09,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 434. [2021-08-29 22:23:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 433 states have (on average 2.928406466512702) internal successors, (1268), 433 states have internal predecessors, (1268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1268 transitions. [2021-08-29 22:23:09,631 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1268 transitions. Word has length 12 [2021-08-29 22:23:09,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:09,632 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1268 transitions. [2021-08-29 22:23:09,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1268 transitions. [2021-08-29 22:23:09,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 22:23:09,633 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:09,633 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:09,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 22:23:09,633 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:09,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:09,644 INFO L82 PathProgramCache]: Analyzing trace with hash -538490512, now seen corresponding path program 1 times [2021-08-29 22:23:09,644 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:09,644 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492596599] [2021-08-29 22:23:09,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:09,645 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:09,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:09,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:09,778 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:09,778 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492596599] [2021-08-29 22:23:09,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492596599] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:09,778 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:09,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:23:09,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032800208] [2021-08-29 22:23:09,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:23:09,779 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:09,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:23:09,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:09,780 INFO L87 Difference]: Start difference. First operand 434 states and 1268 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:09,835 INFO L93 Difference]: Finished difference Result 428 states and 1247 transitions. [2021-08-29 22:23:09,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:09,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-29 22:23:09,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:09,837 INFO L225 Difference]: With dead ends: 428 [2021-08-29 22:23:09,838 INFO L226 Difference]: Without dead ends: 428 [2021-08-29 22:23:09,838 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 23.58ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:09,838 INFO L928 BasicCegarLoop]: 10 mSDtfsCounter, 34 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.50ms SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.69ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:09,838 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.50ms Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 50.69ms Time] [2021-08-29 22:23:09,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-08-29 22:23:09,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2021-08-29 22:23:09,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 427 states have (on average 2.920374707259953) internal successors, (1247), 427 states have internal predecessors, (1247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1247 transitions. [2021-08-29 22:23:09,847 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1247 transitions. Word has length 12 [2021-08-29 22:23:09,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:09,847 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1247 transitions. [2021-08-29 22:23:09,847 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,848 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1247 transitions. [2021-08-29 22:23:09,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:23:09,848 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:09,848 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:09,864 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 22:23:09,865 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:09,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:09,865 INFO L82 PathProgramCache]: Analyzing trace with hash 512081543, now seen corresponding path program 1 times [2021-08-29 22:23:09,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:09,865 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687043197] [2021-08-29 22:23:09,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:09,866 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:09,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:09,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:09,920 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:09,920 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687043197] [2021-08-29 22:23:09,920 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687043197] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:09,920 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:09,921 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:23:09,921 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910854789] [2021-08-29 22:23:09,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:23:09,921 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:09,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:23:09,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:23:09,922 INFO L87 Difference]: Start difference. First operand 428 states and 1247 transitions. Second operand has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:09,963 INFO L93 Difference]: Finished difference Result 619 states and 1750 transitions. [2021-08-29 22:23:09,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:23:09,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 22:23:09,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:09,966 INFO L225 Difference]: With dead ends: 619 [2021-08-29 22:23:09,966 INFO L226 Difference]: Without dead ends: 442 [2021-08-29 22:23:09,966 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.28ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:23:09,966 INFO L928 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.20ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.22ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 36.99ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:09,967 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 27 Invalid, 26 Unknown, 0 Unchecked, 0.22ms Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 36.99ms Time] [2021-08-29 22:23:09,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-08-29 22:23:09,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 418. [2021-08-29 22:23:09,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 417 states have (on average 2.774580335731415) internal successors, (1157), 417 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1157 transitions. [2021-08-29 22:23:09,991 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1157 transitions. Word has length 13 [2021-08-29 22:23:09,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:09,991 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 1157 transitions. [2021-08-29 22:23:09,991 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.5) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:09,991 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1157 transitions. [2021-08-29 22:23:09,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:23:09,992 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:09,992 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:09,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 22:23:09,993 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:09,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:09,993 INFO L82 PathProgramCache]: Analyzing trace with hash 486667340, now seen corresponding path program 1 times [2021-08-29 22:23:09,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:09,993 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692294537] [2021-08-29 22:23:09,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:09,994 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,158 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,158 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692294537] [2021-08-29 22:23:10,158 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1692294537] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,158 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,158 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:23:10,159 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047023105] [2021-08-29 22:23:10,159 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:23:10,159 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:23:10,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,159 INFO L87 Difference]: Start difference. First operand 418 states and 1157 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:10,240 INFO L93 Difference]: Finished difference Result 455 states and 1236 transitions. [2021-08-29 22:23:10,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:23:10,241 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 22:23:10,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:10,243 INFO L225 Difference]: With dead ends: 455 [2021-08-29 22:23:10,243 INFO L226 Difference]: Without dead ends: 431 [2021-08-29 22:23:10,243 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 17.96ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,243 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 9 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 67.84ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.58ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 76.61ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:10,244 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 43 Invalid, 68 Unknown, 0 Unchecked, 0.58ms Time], IncrementalHoareTripleChecker [8 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 76.61ms Time] [2021-08-29 22:23:10,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-08-29 22:23:10,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 422. [2021-08-29 22:23:10,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 421 states have (on average 2.7482185273159145) internal successors, (1157), 421 states have internal predecessors, (1157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1157 transitions. [2021-08-29 22:23:10,272 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1157 transitions. Word has length 13 [2021-08-29 22:23:10,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:10,272 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 1157 transitions. [2021-08-29 22:23:10,272 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,272 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1157 transitions. [2021-08-29 22:23:10,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:23:10,273 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:10,273 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:10,273 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 22:23:10,273 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:10,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:10,274 INFO L82 PathProgramCache]: Analyzing trace with hash 486667123, now seen corresponding path program 1 times [2021-08-29 22:23:10,274 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:10,274 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686006541] [2021-08-29 22:23:10,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:10,274 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,376 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,376 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686006541] [2021-08-29 22:23:10,376 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686006541] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,376 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,376 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:23:10,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196733535] [2021-08-29 22:23:10,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:23:10,377 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:23:10,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,378 INFO L87 Difference]: Start difference. First operand 422 states and 1157 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:10,423 INFO L93 Difference]: Finished difference Result 427 states and 1168 transitions. [2021-08-29 22:23:10,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:10,423 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 22:23:10,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:10,425 INFO L225 Difference]: With dead ends: 427 [2021-08-29 22:23:10,425 INFO L226 Difference]: Without dead ends: 427 [2021-08-29 22:23:10,425 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.87ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,426 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 5 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.93ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.67ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:10,427 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 34 Invalid, 54 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [6 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 40.67ms Time] [2021-08-29 22:23:10,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-08-29 22:23:10,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2021-08-29 22:23:10,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 424 states have (on average 2.7476415094339623) internal successors, (1165), 424 states have internal predecessors, (1165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1165 transitions. [2021-08-29 22:23:10,434 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1165 transitions. Word has length 13 [2021-08-29 22:23:10,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:10,435 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 1165 transitions. [2021-08-29 22:23:10,435 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,435 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1165 transitions. [2021-08-29 22:23:10,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:23:10,436 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:10,436 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:10,436 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 22:23:10,436 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:10,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:10,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1556169017, now seen corresponding path program 2 times [2021-08-29 22:23:10,437 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:10,437 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207961800] [2021-08-29 22:23:10,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:10,437 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,535 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,536 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207961800] [2021-08-29 22:23:10,536 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207961800] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,536 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,536 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:23:10,536 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910079110] [2021-08-29 22:23:10,536 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:23:10,536 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:23:10,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,537 INFO L87 Difference]: Start difference. First operand 425 states and 1165 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:10,581 INFO L93 Difference]: Finished difference Result 419 states and 1146 transitions. [2021-08-29 22:23:10,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:10,582 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 22:23:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:10,583 INFO L225 Difference]: With dead ends: 419 [2021-08-29 22:23:10,584 INFO L226 Difference]: Without dead ends: 419 [2021-08-29 22:23:10,584 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.12ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,584 INFO L928 BasicCegarLoop]: 12 mSDtfsCounter, 9 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.22ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.22ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.96ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:10,585 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 28 Invalid, 45 Unknown, 0 Unchecked, 0.22ms Time], IncrementalHoareTripleChecker [8 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 39.96ms Time] [2021-08-29 22:23:10,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-08-29 22:23:10,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2021-08-29 22:23:10,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 415 states have (on average 2.742168674698795) internal successors, (1138), 415 states have internal predecessors, (1138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1138 transitions. [2021-08-29 22:23:10,592 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1138 transitions. Word has length 13 [2021-08-29 22:23:10,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:10,593 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1138 transitions. [2021-08-29 22:23:10,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,593 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1138 transitions. [2021-08-29 22:23:10,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:23:10,593 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:10,594 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:10,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 22:23:10,594 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:10,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:10,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1305342717, now seen corresponding path program 1 times [2021-08-29 22:23:10,594 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:10,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165443188] [2021-08-29 22:23:10,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:10,595 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,629 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,629 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165443188] [2021-08-29 22:23:10,629 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165443188] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,629 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,630 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:23:10,630 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785596414] [2021-08-29 22:23:10,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:23:10,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:23:10,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:10,631 INFO L87 Difference]: Start difference. First operand 416 states and 1138 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:10,683 INFO L93 Difference]: Finished difference Result 572 states and 1551 transitions. [2021-08-29 22:23:10,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:23:10,683 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 22:23:10,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:10,685 INFO L225 Difference]: With dead ends: 572 [2021-08-29 22:23:10,685 INFO L226 Difference]: Without dead ends: 398 [2021-08-29 22:23:10,685 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.25ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,685 INFO L928 BasicCegarLoop]: 24 mSDtfsCounter, 30 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.77ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.48ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:10,685 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 53 Invalid, 48 Unknown, 0 Unchecked, 0.34ms Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 44.48ms Time] [2021-08-29 22:23:10,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-08-29 22:23:10,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 374. [2021-08-29 22:23:10,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 373 states have (on average 2.67828418230563) internal successors, (999), 373 states have internal predecessors, (999), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 999 transitions. [2021-08-29 22:23:10,692 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 999 transitions. Word has length 14 [2021-08-29 22:23:10,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:10,692 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 999 transitions. [2021-08-29 22:23:10,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,693 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 999 transitions. [2021-08-29 22:23:10,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:23:10,693 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:10,693 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:10,694 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 22:23:10,694 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:10,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:10,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1306688427, now seen corresponding path program 2 times [2021-08-29 22:23:10,694 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:10,694 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810580540] [2021-08-29 22:23:10,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:10,695 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,752 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,752 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810580540] [2021-08-29 22:23:10,752 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810580540] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,752 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,752 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:23:10,753 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034931870] [2021-08-29 22:23:10,753 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:23:10,753 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:23:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:23:10,753 INFO L87 Difference]: Start difference. First operand 374 states and 999 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:10,791 INFO L93 Difference]: Finished difference Result 372 states and 878 transitions. [2021-08-29 22:23:10,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:10,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 22:23:10,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:10,792 INFO L225 Difference]: With dead ends: 372 [2021-08-29 22:23:10,792 INFO L226 Difference]: Without dead ends: 278 [2021-08-29 22:23:10,793 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.51ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,793 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 35 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 25.89ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.18ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.98ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:10,793 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 22 Invalid, 35 Unknown, 0 Unchecked, 0.18ms Time], IncrementalHoareTripleChecker [5 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 30.98ms Time] [2021-08-29 22:23:10,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-08-29 22:23:10,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-08-29 22:23:10,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 277 states have (on average 2.3285198555956677) internal successors, (645), 277 states have internal predecessors, (645), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 645 transitions. [2021-08-29 22:23:10,798 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 645 transitions. Word has length 14 [2021-08-29 22:23:10,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:10,798 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 645 transitions. [2021-08-29 22:23:10,798 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,798 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 645 transitions. [2021-08-29 22:23:10,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:23:10,799 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:10,799 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:10,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 22:23:10,799 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:10,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:10,800 INFO L82 PathProgramCache]: Analyzing trace with hash -1506293769, now seen corresponding path program 1 times [2021-08-29 22:23:10,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:10,800 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390465800] [2021-08-29 22:23:10,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:10,800 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,838 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,839 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,839 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390465800] [2021-08-29 22:23:10,839 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390465800] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,839 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,839 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:23:10,839 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966906987] [2021-08-29 22:23:10,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:23:10,840 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:23:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:23:10,840 INFO L87 Difference]: Start difference. First operand 278 states and 645 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:10,894 INFO L93 Difference]: Finished difference Result 231 states and 488 transitions. [2021-08-29 22:23:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:23:10,894 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 22:23:10,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:10,895 INFO L225 Difference]: With dead ends: 231 [2021-08-29 22:23:10,895 INFO L226 Difference]: Without dead ends: 179 [2021-08-29 22:23:10,895 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.76ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:23:10,896 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 59 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 34.91ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.24ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.98ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:10,896 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 26 Invalid, 51 Unknown, 0 Unchecked, 0.24ms Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 41.98ms Time] [2021-08-29 22:23:10,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-08-29 22:23:10,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2021-08-29 22:23:10,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 170 states have (on average 2.070588235294118) internal successors, (352), 170 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 352 transitions. [2021-08-29 22:23:10,899 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 352 transitions. Word has length 15 [2021-08-29 22:23:10,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:10,899 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 352 transitions. [2021-08-29 22:23:10,900 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:10,900 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 352 transitions. [2021-08-29 22:23:10,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:23:10,900 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:10,900 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:10,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 22:23:10,901 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash 75853903, now seen corresponding path program 1 times [2021-08-29 22:23:10,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:10,901 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417070252] [2021-08-29 22:23:10,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:10,901 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:10,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:10,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:10,949 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:10,949 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417070252] [2021-08-29 22:23:10,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417070252] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:10,949 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:10,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:23:10,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216720878] [2021-08-29 22:23:10,950 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:23:10,950 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:10,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:23:10,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:23:10,950 INFO L87 Difference]: Start difference. First operand 171 states and 352 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:11,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:11,005 INFO L93 Difference]: Finished difference Result 153 states and 315 transitions. [2021-08-29 22:23:11,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:23:11,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2021-08-29 22:23:11,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:11,006 INFO L225 Difference]: With dead ends: 153 [2021-08-29 22:23:11,006 INFO L226 Difference]: Without dead ends: 97 [2021-08-29 22:23:11,007 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 23.19ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:23:11,007 INFO L928 BasicCegarLoop]: 8 mSDtfsCounter, 66 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.24ms SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.28ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:11,007 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 21 Invalid, 53 Unknown, 0 Unchecked, 0.24ms Time], IncrementalHoareTripleChecker [17 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 38.28ms Time] [2021-08-29 22:23:11,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-08-29 22:23:11,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2021-08-29 22:23:11,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.0869565217391304) internal successors, (192), 92 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:11,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 192 transitions. [2021-08-29 22:23:11,009 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 192 transitions. Word has length 17 [2021-08-29 22:23:11,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:11,009 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 192 transitions. [2021-08-29 22:23:11,010 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 192 transitions. [2021-08-29 22:23:11,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 22:23:11,010 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:11,010 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:11,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 22:23:11,011 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:11,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:11,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1682708153, now seen corresponding path program 1 times [2021-08-29 22:23:11,011 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:11,011 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812101168] [2021-08-29 22:23:11,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:11,012 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:11,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:23:11,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:23:11,204 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:23:11,204 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812101168] [2021-08-29 22:23:11,204 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812101168] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:23:11,204 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:23:11,205 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:23:11,205 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577484231] [2021-08-29 22:23:11,205 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:23:11,205 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:23:11,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:23:11,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:23:11,206 INFO L87 Difference]: Start difference. First operand 93 states and 192 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-08-29 22:23:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:23:11,289 INFO L93 Difference]: Finished difference Result 113 states and 227 transitions. [2021-08-29 22:23:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:23:11,290 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-08-29 22:23:11,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:23:11,290 INFO L225 Difference]: With dead ends: 113 [2021-08-29 22:23:11,290 INFO L226 Difference]: Without dead ends: 59 [2021-08-29 22:23:11,290 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 88.22ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:23:11,291 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.72ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.21ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.54ms IncrementalHoareTripleChecker+Time [2021-08-29 22:23:11,291 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 19 Invalid, 47 Unknown, 0 Unchecked, 0.21ms Time], IncrementalHoareTripleChecker [22 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 38.54ms Time] [2021-08-29 22:23:11,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-08-29 22:23:11,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-08-29 22:23:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 58 states have (on average 1.793103448275862) internal successors, (104), 58 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:23:11,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2021-08-29 22:23:11,293 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 20 [2021-08-29 22:23:11,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:23:11,293 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2021-08-29 22:23:11,293 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 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-08-29 22:23:11,293 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2021-08-29 22:23:11,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-08-29 22:23:11,293 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:23:11,293 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:23:11,293 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 22:23:11,293 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-29 22:23:11,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:23:11,294 INFO L82 PathProgramCache]: Analyzing trace with hash 718213703, now seen corresponding path program 2 times [2021-08-29 22:23:11,294 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:23:11,294 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968705899] [2021-08-29 22:23:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:23:11,294 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:23:11,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:23:11,322 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 22:23:11,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:23:11,368 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 22:23:11,368 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 22:23:11,369 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining) [2021-08-29 22:23:11,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining) [2021-08-29 22:23:11,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (3 of 6 remaining) [2021-08-29 22:23:11,370 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (2 of 6 remaining) [2021-08-29 22:23:11,371 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (1 of 6 remaining) [2021-08-29 22:23:11,371 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 6 remaining) [2021-08-29 22:23:11,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 22:23:11,374 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 22:23:11,375 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 22:23:11,424 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:23:11 BasicIcfg [2021-08-29 22:23:11,424 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 22:23:11,425 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 22:23:11,425 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 22:23:11,425 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 22:23:11,428 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:22:53" (3/4) ... [2021-08-29 22:23:11,430 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 22:23:11,484 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 22:23:11,485 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 22:23:11,485 INFO L158 Benchmark]: Toolchain (without parser) took 19658.25ms. Allocated memory was 62.9MB in the beginning and 211.8MB in the end (delta: 148.9MB). Free memory was 42.0MB in the beginning and 112.6MB in the end (delta: -70.7MB). Peak memory consumption was 78.2MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,485 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 62.9MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 22:23:11,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 452.29ms. Allocated memory is still 62.9MB. Free memory was 41.8MB in the beginning and 33.6MB in the end (delta: 8.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,486 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.97ms. Allocated memory is still 62.9MB. Free memory was 33.6MB in the beginning and 30.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,486 INFO L158 Benchmark]: Boogie Preprocessor took 46.81ms. Allocated memory is still 62.9MB. Free memory was 30.6MB in the beginning and 28.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,486 INFO L158 Benchmark]: RCFGBuilder took 672.00ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 28.3MB in the beginning and 59.3MB in the end (delta: -31.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,486 INFO L158 Benchmark]: TraceAbstraction took 18357.70ms. Allocated memory was 83.9MB in the beginning and 211.8MB in the end (delta: 127.9MB). Free memory was 58.8MB in the beginning and 125.2MB in the end (delta: -66.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,487 INFO L158 Benchmark]: Witness Printer took 59.84ms. Allocated memory is still 211.8MB. Free memory was 125.2MB in the beginning and 112.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-08-29 22:23:11,488 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.15ms. Allocated memory is still 62.9MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 452.29ms. Allocated memory is still 62.9MB. Free memory was 41.8MB in the beginning and 33.6MB in the end (delta: 8.2MB). Peak memory consumption was 11.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.97ms. Allocated memory is still 62.9MB. Free memory was 33.6MB in the beginning and 30.6MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.81ms. Allocated memory is still 62.9MB. Free memory was 30.6MB in the beginning and 28.3MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 672.00ms. Allocated memory was 62.9MB in the beginning and 83.9MB in the end (delta: 21.0MB). Free memory was 28.3MB in the beginning and 59.3MB in the end (delta: -31.0MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 18357.70ms. Allocated memory was 83.9MB in the beginning and 211.8MB in the end (delta: 127.9MB). Free memory was 58.8MB in the beginning and 125.2MB in the end (delta: -66.4MB). Peak memory consumption was 61.3MB. Max. memory is 16.1GB. * Witness Printer took 59.84ms. Allocated memory is still 211.8MB. Free memory was 125.2MB in the beginning and 112.6MB in the end (delta: 12.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15331.90ms, 112 PlacesBefore, 35 PlacesAfterwards, 104 TransitionsBefore, 25 TransitionsAfterwards, 1776 CoEnabledTransitionPairs, 6 FixpointIterations, 36 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 4 ConcurrentYvCompositions, 2 ChoiceCompositions, 90 TotalNumberOfCompositions, 3997 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2115, positive: 1984, positive conditional: 0, positive unconditional: 1984, negative: 131, negative conditional: 0, negative unconditional: 131, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1246, positive: 1184, positive conditional: 0, positive unconditional: 1184, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1246, positive: 1176, positive conditional: 0, positive unconditional: 1176, negative: 70, negative conditional: 0, negative unconditional: 70, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 70, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 62, negative conditional: 0, negative unconditional: 62, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 560, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 548, negative conditional: 0, negative unconditional: 548, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 2115, positive: 800, positive conditional: 0, positive unconditional: 800, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 1246, unknown conditional: 0, unknown unconditional: 1246] , Statistics on independence cache: Total cache size (in pairs): 120, Positive cache size: 92, Positive conditional cache size: 0, Positive unconditional cache size: 92, Negative cache size: 28, Negative conditional cache size: 0, Negative unconditional cache size: 28 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [L712] 0 _Bool main$tmp_guard0; [L713] 0 _Bool main$tmp_guard1; [L715] 0 int x = 0; [L717] 0 int y = 0; [L718] 0 _Bool y$flush_delayed; [L719] 0 int y$mem_tmp; [L720] 0 _Bool y$r_buff0_thd0; [L721] 0 _Bool y$r_buff0_thd1; [L722] 0 _Bool y$r_buff0_thd2; [L723] 0 _Bool y$r_buff0_thd3; [L724] 0 _Bool y$r_buff1_thd0; [L725] 0 _Bool y$r_buff1_thd1; [L726] 0 _Bool y$r_buff1_thd2; [L727] 0 _Bool y$r_buff1_thd3; [L728] 0 _Bool y$read_delayed; [L729] 0 int *y$read_delayed_var; [L730] 0 int y$w_buff0; [L731] 0 _Bool y$w_buff0_used; [L732] 0 int y$w_buff1; [L733] 0 _Bool y$w_buff1_used; [L734] 0 _Bool weak$$choice0; [L735] 0 _Bool weak$$choice2; [L813] 0 pthread_t t2192; [L814] FCALL, FORK 0 pthread_create(&t2192, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2193; [L816] FCALL, FORK 0 pthread_create(&t2193, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2194; [L818] FCALL, FORK 0 pthread_create(&t2194, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L763] 1 return 0; [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L771] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L778] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L780] 2 return 0; [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L800] 3 return 0; [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 2) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=2, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=51, weak$$choice2=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 130 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 18201.46ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 16.96ms, AutomataDifference: 920.24ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 15429.38ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 365 SdHoareTripleChecker+Valid, 644.08ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 365 mSDsluCounter, 406 SdHoareTripleChecker+Invalid, 560.40ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 371 mSDsCounter, 103 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 498 IncrementalHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 103 mSolverCounterUnsat, 177 mSDtfsCounter, 498 mSolverCounterSat, 5.69ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 231.77ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=582occurred in iteration=0, InterpolantAutomatonStates: 62, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 210.90ms AutomataMinimizationTime, 15 MinimizatonAttempts, 88 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 31.83ms SsaConstructionTime, 428.53ms SatisfiabilityAnalysisTime, 885.59ms InterpolantComputationTime, 209 NumberOfCodeBlocks, 209 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 1446 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 22:23:11,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...