./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 997cd7c3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/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-dev-997cd7c-m [2021-09-22 14:50:19,919 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-09-22 14:50:19,920 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-09-22 14:50:19,944 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-09-22 14:50:19,945 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-09-22 14:50:19,948 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-09-22 14:50:19,950 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-09-22 14:50:19,954 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-09-22 14:50:19,956 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-09-22 14:50:19,961 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-09-22 14:50:19,962 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-09-22 14:50:19,963 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-09-22 14:50:19,963 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-09-22 14:50:19,965 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-09-22 14:50:19,966 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-09-22 14:50:19,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-09-22 14:50:19,969 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-09-22 14:50:19,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-09-22 14:50:19,973 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-09-22 14:50:19,975 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-09-22 14:50:19,977 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-09-22 14:50:19,979 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-09-22 14:50:19,980 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-09-22 14:50:19,981 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-09-22 14:50:19,983 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-09-22 14:50:19,987 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-09-22 14:50:19,987 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-09-22 14:50:19,988 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-09-22 14:50:19,989 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-09-22 14:50:19,989 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-09-22 14:50:19,990 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-09-22 14:50:19,990 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-09-22 14:50:19,991 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-09-22 14:50:19,992 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-09-22 14:50:19,993 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-09-22 14:50:19,993 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-09-22 14:50:19,993 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-09-22 14:50:19,994 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-09-22 14:50:19,994 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-09-22 14:50:19,994 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-09-22 14:50:19,996 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-09-22 14:50:19,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-09-22 14:50:20,028 INFO L113 SettingsManager]: Loading preferences was successful [2021-09-22 14:50:20,029 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-09-22 14:50:20,030 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-09-22 14:50:20,030 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-09-22 14:50:20,032 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-09-22 14:50:20,032 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-09-22 14:50:20,032 INFO L138 SettingsManager]: * Use SBE=true [2021-09-22 14:50:20,032 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-09-22 14:50:20,032 INFO L138 SettingsManager]: * sizeof long=4 [2021-09-22 14:50:20,032 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-09-22 14:50:20,033 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-09-22 14:50:20,033 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-09-22 14:50:20,033 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-09-22 14:50:20,034 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-09-22 14:50:20,034 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-09-22 14:50:20,034 INFO L138 SettingsManager]: * sizeof long double=12 [2021-09-22 14:50:20,034 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-09-22 14:50:20,034 INFO L138 SettingsManager]: * Use constant arrays=true [2021-09-22 14:50:20,034 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-09-22 14:50:20,035 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-09-22 14:50:20,035 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-09-22 14:50:20,035 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-09-22 14:50:20,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:50:20,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-09-22 14:50:20,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-09-22 14:50:20,035 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-09-22 14:50:20,036 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-09-22 14:50:20,036 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-09-22 14:50:20,036 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-09-22 14:50:20,036 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-09-22 14:50:20,036 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-09-22 14:50:20,294 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-09-22 14:50:20,330 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-09-22 14:50:20,332 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-09-22 14:50:20,332 INFO L271 PluginConnector]: Initializing CDTParser... [2021-09-22 14:50:20,334 INFO L275 PluginConnector]: CDTParser initialized [2021-09-22 14:50:20,335 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-09-22 14:50:20,396 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f20f8af2/1de4001664194176b7132baf57064e3f/FLAGa1072833a [2021-09-22 14:50:20,810 INFO L306 CDTParser]: Found 1 translation units. [2021-09-22 14:50:20,810 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe017_rmo.opt.i [2021-09-22 14:50:20,819 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f20f8af2/1de4001664194176b7132baf57064e3f/FLAGa1072833a [2021-09-22 14:50:20,827 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f20f8af2/1de4001664194176b7132baf57064e3f [2021-09-22 14:50:20,828 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-09-22 14:50:20,829 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-09-22 14:50:20,835 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-09-22 14:50:20,835 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-09-22 14:50:20,838 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-09-22 14:50:20,838 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:50:20" (1/1) ... [2021-09-22 14:50:20,839 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@269cd2f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:20, skipping insertion in model container [2021-09-22 14:50:20,839 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.09 02:50:20" (1/1) ... [2021-09-22 14:50:20,844 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-09-22 14:50:20,868 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-09-22 14:50:20,991 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-09-22 14:50:21,087 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:50:21,093 INFO L203 MainTranslator]: Completed pre-run [2021-09-22 14:50:21,101 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-09-22 14:50:21,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-09-22 14:50:21,153 INFO L208 MainTranslator]: Completed translation [2021-09-22 14:50:21,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21 WrapperNode [2021-09-22 14:50:21,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-09-22 14:50:21,154 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-09-22 14:50:21,154 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-09-22 14:50:21,154 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-09-22 14:50:21,159 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,170 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,194 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-09-22 14:50:21,195 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-09-22 14:50:21,195 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-09-22 14:50:21,195 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-09-22 14:50:21,201 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,201 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,209 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,213 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,216 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-09-22 14:50:21,216 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-09-22 14:50:21,216 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-09-22 14:50:21,217 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-09-22 14:50:21,217 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (1/1) ... [2021-09-22 14:50:21,222 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-09-22 14:50:21,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-09-22 14:50:21,237 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-09-22 14:50:21,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-09-22 14:50:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-09-22 14:50:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-09-22 14:50:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-09-22 14:50:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-09-22 14:50:21,268 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-09-22 14:50:21,268 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-09-22 14:50:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-09-22 14:50:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-09-22 14:50:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-09-22 14:50:21,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-09-22 14:50:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-09-22 14:50:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-09-22 14:50:21,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-09-22 14:50:21,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-09-22 14:50:21,271 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-09-22 14:50:22,444 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-09-22 14:50:22,444 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-09-22 14:50:22,446 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:50:22 BoogieIcfgContainer [2021-09-22 14:50:22,446 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-09-22 14:50:22,448 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-09-22 14:50:22,448 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-09-22 14:50:22,450 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-09-22 14:50:22,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.09 02:50:20" (1/3) ... [2021-09-22 14:50:22,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db41d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:50:22, skipping insertion in model container [2021-09-22 14:50:22,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.09 02:50:21" (2/3) ... [2021-09-22 14:50:22,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7db41d6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.09 02:50:22, skipping insertion in model container [2021-09-22 14:50:22,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:50:22" (3/3) ... [2021-09-22 14:50:22,452 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_rmo.opt.i [2021-09-22 14:50:22,456 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-09-22 14:50:22,456 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-09-22 14:50:22,457 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-09-22 14:50:22,457 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-09-22 14:50:22,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,491 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,491 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,492 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,493 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,493 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,494 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,495 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,496 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,497 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,499 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,500 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,500 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,501 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,502 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,503 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,504 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,505 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,506 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,506 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,507 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,508 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,509 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,511 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,511 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,512 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,513 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,514 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,515 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,516 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,517 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,517 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-09-22 14:50:22,518 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-09-22 14:50:22,544 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-09-22 14:50:22,548 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-09-22 14:50:22,548 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-09-22 14:50:22,557 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-09-22 14:50:22,563 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 112 places, 104 transitions, 223 flow [2021-09-22 14:50:22,565 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 112 places, 104 transitions, 223 flow [2021-09-22 14:50:22,566 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 112 places, 104 transitions, 223 flow [2021-09-22 14:50:22,588 INFO L129 PetriNetUnfolder]: 2/101 cut-off events. [2021-09-22 14:50:22,588 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-09-22 14:50:22,590 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-09-22 14:50:22,592 INFO L116 LiptonReduction]: Number of co-enabled transitions 1776 [2021-09-22 14:50:37,788 INFO L131 LiptonReduction]: Checked pairs total: 3997 [2021-09-22 14:50:37,788 INFO L133 LiptonReduction]: Total number of compositions: 90 [2021-09-22 14:50:37,795 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 35 places, 25 transitions, 65 flow [2021-09-22 14:50:37,859 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-09-22 14:50:37,862 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-09-22 14:50:37,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-09-22 14:50:37,865 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:37,865 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-09-22 14:50:37,866 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:37,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:37,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1079556, now seen corresponding path program 1 times [2021-09-22 14:50:37,878 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:37,879 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202281899] [2021-09-22 14:50:37,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:37,880 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:38,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:38,068 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:38,068 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202281899] [2021-09-22 14:50:38,069 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202281899] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:38,069 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:38,069 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:50:38,070 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828810430] [2021-09-22 14:50:38,076 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:50:38,076 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:38,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:50:38,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:50:38,091 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-09-22 14:50:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:38,161 INFO L93 Difference]: Finished difference Result 472 states and 1413 transitions. [2021-09-22 14:50:38,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:50:38,162 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-09-22 14:50:38,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:38,180 INFO L225 Difference]: With dead ends: 472 [2021-09-22 14:50:38,181 INFO L226 Difference]: Without dead ends: 452 [2021-09-22 14:50:38,182 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:50:38,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 452 states. [2021-09-22 14:50:38,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 452 to 452. [2021-09-22 14:50:38,250 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-09-22 14:50:38,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 1362 transitions. [2021-09-22 14:50:38,256 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 1362 transitions. Word has length 3 [2021-09-22 14:50:38,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:38,256 INFO L470 AbstractCegarLoop]: Abstraction has 452 states and 1362 transitions. [2021-09-22 14:50:38,256 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-09-22 14:50:38,256 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 1362 transitions. [2021-09-22 14:50:38,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-09-22 14:50:38,258 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:38,258 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:38,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-09-22 14:50:38,258 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:38,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:38,259 INFO L82 PathProgramCache]: Analyzing trace with hash -375869118, now seen corresponding path program 1 times [2021-09-22 14:50:38,259 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:38,260 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075934382] [2021-09-22 14:50:38,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:38,260 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:38,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:38,425 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:38,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:38,426 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075934382] [2021-09-22 14:50:38,426 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075934382] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:38,426 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:38,426 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-09-22 14:50:38,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089034748] [2021-09-22 14:50:38,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:50:38,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:38,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:50:38,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:50:38,428 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-09-22 14:50:38,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:38,438 INFO L93 Difference]: Finished difference Result 432 states and 1291 transitions. [2021-09-22 14:50:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:50:38,443 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-09-22 14:50:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:38,445 INFO L225 Difference]: With dead ends: 432 [2021-09-22 14:50:38,445 INFO L226 Difference]: Without dead ends: 432 [2021-09-22 14:50:38,446 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:50:38,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2021-09-22 14:50:38,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2021-09-22 14:50:38,466 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-09-22 14:50:38,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 1291 transitions. [2021-09-22 14:50:38,468 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 1291 transitions. Word has length 9 [2021-09-22 14:50:38,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:38,469 INFO L470 AbstractCegarLoop]: Abstraction has 432 states and 1291 transitions. [2021-09-22 14:50:38,469 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-09-22 14:50:38,469 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 1291 transitions. [2021-09-22 14:50:38,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-09-22 14:50:38,470 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:38,470 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:38,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-09-22 14:50:38,470 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:38,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:38,471 INFO L82 PathProgramCache]: Analyzing trace with hash 1231757885, now seen corresponding path program 1 times [2021-09-22 14:50:38,471 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:38,471 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894864191] [2021-09-22 14:50:38,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:38,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:38,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:38,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:38,560 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894864191] [2021-09-22 14:50:38,561 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894864191] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:38,561 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:38,561 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:50:38,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949742965] [2021-09-22 14:50:38,561 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:50:38,561 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:38,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:50:38,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:38,562 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-09-22 14:50:38,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:38,580 INFO L93 Difference]: Finished difference Result 640 states and 1891 transitions. [2021-09-22 14:50:38,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:38,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-09-22 14:50:38,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:38,582 INFO L225 Difference]: With dead ends: 640 [2021-09-22 14:50:38,583 INFO L226 Difference]: Without dead ends: 400 [2021-09-22 14:50:38,583 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:38,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2021-09-22 14:50:38,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 400. [2021-09-22 14:50:38,593 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-09-22 14:50:38,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 400 states and 1173 transitions. [2021-09-22 14:50:38,594 INFO L78 Accepts]: Start accepts. Automaton has 400 states and 1173 transitions. Word has length 10 [2021-09-22 14:50:38,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:38,595 INFO L470 AbstractCegarLoop]: Abstraction has 400 states and 1173 transitions. [2021-09-22 14:50:38,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:50:38,595 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 1173 transitions. [2021-09-22 14:50:38,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-09-22 14:50:38,596 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:38,596 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:38,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-09-22 14:50:38,596 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:38,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:38,597 INFO L82 PathProgramCache]: Analyzing trace with hash -433012595, now seen corresponding path program 1 times [2021-09-22 14:50:38,597 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:38,597 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951517051] [2021-09-22 14:50:38,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:38,597 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:38,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:38,662 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:38,662 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:38,662 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951517051] [2021-09-22 14:50:38,662 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951517051] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:38,663 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:38,663 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:50:38,663 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245692349] [2021-09-22 14:50:38,663 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:50:38,663 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:38,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:50:38,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:38,664 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-09-22 14:50:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:38,701 INFO L93 Difference]: Finished difference Result 396 states and 1157 transitions. [2021-09-22 14:50:38,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:38,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-09-22 14:50:38,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:38,704 INFO L225 Difference]: With dead ends: 396 [2021-09-22 14:50:38,704 INFO L226 Difference]: Without dead ends: 396 [2021-09-22 14:50:38,705 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:38,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2021-09-22 14:50:38,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2021-09-22 14:50:38,712 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-09-22 14:50:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 1157 transitions. [2021-09-22 14:50:38,714 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 1157 transitions. Word has length 11 [2021-09-22 14:50:38,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:38,714 INFO L470 AbstractCegarLoop]: Abstraction has 396 states and 1157 transitions. [2021-09-22 14:50:38,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:50:38,714 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 1157 transitions. [2021-09-22 14:50:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:50:38,715 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:38,716 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:38,716 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-09-22 14:50:38,716 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:38,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash -538490326, now seen corresponding path program 1 times [2021-09-22 14:50:38,717 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:38,717 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943670546] [2021-09-22 14:50:38,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:38,717 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:38,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:38,789 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:38,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:38,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943670546] [2021-09-22 14:50:38,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943670546] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:38,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:38,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:50:38,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606291645] [2021-09-22 14:50:38,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:50:38,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:38,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:50:38,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:38,791 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-09-22 14:50:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:38,826 INFO L93 Difference]: Finished difference Result 448 states and 1301 transitions. [2021-09-22 14:50:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:38,827 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-09-22 14:50:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:38,829 INFO L225 Difference]: With dead ends: 448 [2021-09-22 14:50:38,829 INFO L226 Difference]: Without dead ends: 448 [2021-09-22 14:50:38,829 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:38,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2021-09-22 14:50:38,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 434. [2021-09-22 14:50:38,836 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-09-22 14:50:38,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 1268 transitions. [2021-09-22 14:50:38,838 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 1268 transitions. Word has length 12 [2021-09-22 14:50:38,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:38,838 INFO L470 AbstractCegarLoop]: Abstraction has 434 states and 1268 transitions. [2021-09-22 14:50:38,838 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-09-22 14:50:38,838 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 1268 transitions. [2021-09-22 14:50:38,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-09-22 14:50:38,841 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:38,842 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:38,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-09-22 14:50:38,842 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:38,849 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:38,851 INFO L82 PathProgramCache]: Analyzing trace with hash -538490512, now seen corresponding path program 1 times [2021-09-22 14:50:38,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:38,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672425315] [2021-09-22 14:50:38,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:38,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:38,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:38,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:38,947 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:38,947 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672425315] [2021-09-22 14:50:38,948 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672425315] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:38,948 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:38,948 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:50:38,948 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942376079] [2021-09-22 14:50:38,948 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:50:38,948 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:38,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:50:38,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:38,949 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-09-22 14:50:38,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:38,978 INFO L93 Difference]: Finished difference Result 428 states and 1247 transitions. [2021-09-22 14:50:38,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:38,979 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-09-22 14:50:38,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:38,981 INFO L225 Difference]: With dead ends: 428 [2021-09-22 14:50:38,981 INFO L226 Difference]: Without dead ends: 428 [2021-09-22 14:50:38,981 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 16.2ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:38,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2021-09-22 14:50:38,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2021-09-22 14:50:38,988 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-09-22 14:50:38,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 1247 transitions. [2021-09-22 14:50:38,990 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 1247 transitions. Word has length 12 [2021-09-22 14:50:38,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:38,990 INFO L470 AbstractCegarLoop]: Abstraction has 428 states and 1247 transitions. [2021-09-22 14:50:38,990 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:50:38,990 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 1247 transitions. [2021-09-22 14:50:38,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:50:38,991 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:38,991 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:38,991 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-09-22 14:50:38,991 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:38,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:38,992 INFO L82 PathProgramCache]: Analyzing trace with hash 512081543, now seen corresponding path program 1 times [2021-09-22 14:50:38,992 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:38,992 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640420382] [2021-09-22 14:50:38,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:38,992 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,052 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,052 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640420382] [2021-09-22 14:50:39,052 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640420382] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,052 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,052 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-09-22 14:50:39,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858721361] [2021-09-22 14:50:39,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-09-22 14:50:39,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-09-22 14:50:39,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:50:39,053 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-09-22 14:50:39,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,063 INFO L93 Difference]: Finished difference Result 619 states and 1750 transitions. [2021-09-22 14:50:39,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-09-22 14:50:39,063 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-09-22 14:50:39,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,065 INFO L225 Difference]: With dead ends: 619 [2021-09-22 14:50:39,065 INFO L226 Difference]: Without dead ends: 442 [2021-09-22 14:50:39,065 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-09-22 14:50:39,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2021-09-22 14:50:39,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 418. [2021-09-22 14:50:39,072 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-09-22 14:50:39,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 1157 transitions. [2021-09-22 14:50:39,074 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 1157 transitions. Word has length 13 [2021-09-22 14:50:39,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,074 INFO L470 AbstractCegarLoop]: Abstraction has 418 states and 1157 transitions. [2021-09-22 14:50:39,074 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-09-22 14:50:39,074 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 1157 transitions. [2021-09-22 14:50:39,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:50:39,075 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,075 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,075 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-09-22 14:50:39,075 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,076 INFO L82 PathProgramCache]: Analyzing trace with hash 486667340, now seen corresponding path program 1 times [2021-09-22 14:50:39,076 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,076 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886800606] [2021-09-22 14:50:39,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,076 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,198 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,198 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886800606] [2021-09-22 14:50:39,198 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886800606] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,198 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,198 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:50:39,199 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543353765] [2021-09-22 14:50:39,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:50:39,199 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:50:39,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,200 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-09-22 14:50:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,250 INFO L93 Difference]: Finished difference Result 455 states and 1236 transitions. [2021-09-22 14:50:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:50:39,251 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-09-22 14:50:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,252 INFO L225 Difference]: With dead ends: 455 [2021-09-22 14:50:39,252 INFO L226 Difference]: Without dead ends: 431 [2021-09-22 14:50:39,252 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2021-09-22 14:50:39,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 422. [2021-09-22 14:50:39,259 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-09-22 14:50:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 1157 transitions. [2021-09-22 14:50:39,260 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 1157 transitions. Word has length 13 [2021-09-22 14:50:39,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,261 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 1157 transitions. [2021-09-22 14:50:39,261 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-09-22 14:50:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 1157 transitions. [2021-09-22 14:50:39,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:50:39,261 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,262 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-09-22 14:50:39,262 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,262 INFO L82 PathProgramCache]: Analyzing trace with hash 486667123, now seen corresponding path program 1 times [2021-09-22 14:50:39,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,265 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547176512] [2021-09-22 14:50:39,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,266 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,406 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,406 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547176512] [2021-09-22 14:50:39,407 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547176512] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,408 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:50:39,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [904921499] [2021-09-22 14:50:39,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:50:39,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:50:39,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,411 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-09-22 14:50:39,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,457 INFO L93 Difference]: Finished difference Result 427 states and 1168 transitions. [2021-09-22 14:50:39,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:39,458 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-09-22 14:50:39,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,459 INFO L225 Difference]: With dead ends: 427 [2021-09-22 14:50:39,459 INFO L226 Difference]: Without dead ends: 427 [2021-09-22 14:50:39,460 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.9ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2021-09-22 14:50:39,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 425. [2021-09-22 14:50:39,467 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-09-22 14:50:39,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 1165 transitions. [2021-09-22 14:50:39,468 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 1165 transitions. Word has length 13 [2021-09-22 14:50:39,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,468 INFO L470 AbstractCegarLoop]: Abstraction has 425 states and 1165 transitions. [2021-09-22 14:50:39,468 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-09-22 14:50:39,469 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 1165 transitions. [2021-09-22 14:50:39,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-09-22 14:50:39,469 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,469 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-09-22 14:50:39,470 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,470 INFO L82 PathProgramCache]: Analyzing trace with hash -1556169017, now seen corresponding path program 2 times [2021-09-22 14:50:39,470 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,470 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983906952] [2021-09-22 14:50:39,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,471 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,568 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983906952] [2021-09-22 14:50:39,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983906952] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:50:39,569 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549599348] [2021-09-22 14:50:39,569 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:50:39,569 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:50:39,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,570 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-09-22 14:50:39,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,609 INFO L93 Difference]: Finished difference Result 419 states and 1146 transitions. [2021-09-22 14:50:39,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:39,610 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-09-22 14:50:39,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,611 INFO L225 Difference]: With dead ends: 419 [2021-09-22 14:50:39,611 INFO L226 Difference]: Without dead ends: 419 [2021-09-22 14:50:39,612 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 11.2ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2021-09-22 14:50:39,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2021-09-22 14:50:39,621 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-09-22 14:50:39,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 1138 transitions. [2021-09-22 14:50:39,622 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 1138 transitions. Word has length 13 [2021-09-22 14:50:39,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,622 INFO L470 AbstractCegarLoop]: Abstraction has 416 states and 1138 transitions. [2021-09-22 14:50:39,622 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-09-22 14:50:39,622 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 1138 transitions. [2021-09-22 14:50:39,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:50:39,623 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,623 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-09-22 14:50:39,623 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1305342717, now seen corresponding path program 1 times [2021-09-22 14:50:39,624 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,624 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877776470] [2021-09-22 14:50:39,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,624 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,683 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,684 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877776470] [2021-09-22 14:50:39,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877776470] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,684 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:50:39,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548728829] [2021-09-22 14:50:39,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:50:39,684 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:50:39,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:39,687 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-09-22 14:50:39,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,702 INFO L93 Difference]: Finished difference Result 572 states and 1551 transitions. [2021-09-22 14:50:39,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:50:39,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-09-22 14:50:39,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,704 INFO L225 Difference]: With dead ends: 572 [2021-09-22 14:50:39,704 INFO L226 Difference]: Without dead ends: 398 [2021-09-22 14:50:39,704 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2021-09-22 14:50:39,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 374. [2021-09-22 14:50:39,710 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-09-22 14:50:39,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 999 transitions. [2021-09-22 14:50:39,711 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 999 transitions. Word has length 14 [2021-09-22 14:50:39,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,711 INFO L470 AbstractCegarLoop]: Abstraction has 374 states and 999 transitions. [2021-09-22 14:50:39,711 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-09-22 14:50:39,711 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 999 transitions. [2021-09-22 14:50:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-09-22 14:50:39,712 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,712 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,712 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-09-22 14:50:39,712 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1306688427, now seen corresponding path program 2 times [2021-09-22 14:50:39,713 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,713 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950152329] [2021-09-22 14:50:39,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,713 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,754 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,754 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950152329] [2021-09-22 14:50:39,754 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950152329] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,754 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,754 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-09-22 14:50:39,755 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861181292] [2021-09-22 14:50:39,755 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-09-22 14:50:39,755 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-09-22 14:50:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-09-22 14:50:39,755 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-09-22 14:50:39,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,770 INFO L93 Difference]: Finished difference Result 372 states and 878 transitions. [2021-09-22 14:50:39,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:39,770 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-09-22 14:50:39,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,771 INFO L225 Difference]: With dead ends: 372 [2021-09-22 14:50:39,771 INFO L226 Difference]: Without dead ends: 278 [2021-09-22 14:50:39,771 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-09-22 14:50:39,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-09-22 14:50:39,775 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-09-22 14:50:39,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 645 transitions. [2021-09-22 14:50:39,776 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 645 transitions. Word has length 14 [2021-09-22 14:50:39,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,777 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 645 transitions. [2021-09-22 14:50:39,777 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-09-22 14:50:39,777 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 645 transitions. [2021-09-22 14:50:39,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-09-22 14:50:39,778 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,778 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,778 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-09-22 14:50:39,778 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1506293769, now seen corresponding path program 1 times [2021-09-22 14:50:39,779 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,779 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2082363571] [2021-09-22 14:50:39,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,779 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,840 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,840 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2082363571] [2021-09-22 14:50:39,840 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2082363571] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,840 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,840 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-09-22 14:50:39,840 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589799405] [2021-09-22 14:50:39,841 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-09-22 14:50:39,841 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-09-22 14:50:39,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-09-22 14:50:39,841 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-09-22 14:50:39,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,869 INFO L93 Difference]: Finished difference Result 231 states and 488 transitions. [2021-09-22 14:50:39,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-09-22 14:50:39,869 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-09-22 14:50:39,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,870 INFO L225 Difference]: With dead ends: 231 [2021-09-22 14:50:39,870 INFO L226 Difference]: Without dead ends: 179 [2021-09-22 14:50:39,871 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:50:39,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2021-09-22 14:50:39,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 171. [2021-09-22 14:50:39,873 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-09-22 14:50:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 352 transitions. [2021-09-22 14:50:39,874 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 352 transitions. Word has length 15 [2021-09-22 14:50:39,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,875 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 352 transitions. [2021-09-22 14:50:39,875 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-09-22 14:50:39,875 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 352 transitions. [2021-09-22 14:50:39,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-09-22 14:50:39,875 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,875 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-09-22 14:50:39,876 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,876 INFO L82 PathProgramCache]: Analyzing trace with hash 75853903, now seen corresponding path program 1 times [2021-09-22 14:50:39,876 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,876 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734180495] [2021-09-22 14:50:39,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,877 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:39,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:39,936 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:39,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734180495] [2021-09-22 14:50:39,937 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734180495] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:39,937 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:39,937 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:50:39,937 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955178719] [2021-09-22 14:50:39,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-09-22 14:50:39,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:39,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-09-22 14:50:39,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-09-22 14:50:39,938 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-09-22 14:50:39,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:39,969 INFO L93 Difference]: Finished difference Result 153 states and 315 transitions. [2021-09-22 14:50:39,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-09-22 14:50:39,969 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-09-22 14:50:39,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:39,970 INFO L225 Difference]: With dead ends: 153 [2021-09-22 14:50:39,970 INFO L226 Difference]: Without dead ends: 97 [2021-09-22 14:50:39,970 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 21.4ms TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:50:39,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2021-09-22 14:50:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 93. [2021-09-22 14:50:39,972 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-09-22 14:50:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 192 transitions. [2021-09-22 14:50:39,972 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 192 transitions. Word has length 17 [2021-09-22 14:50:39,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:39,973 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 192 transitions. [2021-09-22 14:50:39,973 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-09-22 14:50:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 192 transitions. [2021-09-22 14:50:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-22 14:50:39,973 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:39,973 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:39,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-09-22 14:50:39,974 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:39,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:39,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1682708153, now seen corresponding path program 1 times [2021-09-22 14:50:39,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:39,974 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955557193] [2021-09-22 14:50:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:39,974 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:39,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-09-22 14:50:40,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-09-22 14:50:40,149 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-09-22 14:50:40,149 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955557193] [2021-09-22 14:50:40,149 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955557193] provided 1 perfect and 0 imperfect interpolant sequences [2021-09-22 14:50:40,149 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-09-22 14:50:40,149 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-09-22 14:50:40,149 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173619095] [2021-09-22 14:50:40,150 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-09-22 14:50:40,150 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-09-22 14:50:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-09-22 14:50:40,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2021-09-22 14:50:40,150 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-09-22 14:50:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-09-22 14:50:40,228 INFO L93 Difference]: Finished difference Result 113 states and 227 transitions. [2021-09-22 14:50:40,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-09-22 14:50:40,228 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-09-22 14:50:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-09-22 14:50:40,229 INFO L225 Difference]: With dead ends: 113 [2021-09-22 14:50:40,229 INFO L226 Difference]: Without dead ends: 59 [2021-09-22 14:50:40,229 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 83.7ms TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2021-09-22 14:50:40,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2021-09-22 14:50:40,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2021-09-22 14:50:40,230 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-09-22 14:50:40,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 104 transitions. [2021-09-22 14:50:40,230 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 104 transitions. Word has length 20 [2021-09-22 14:50:40,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-09-22 14:50:40,230 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 104 transitions. [2021-09-22 14:50:40,230 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-09-22 14:50:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 104 transitions. [2021-09-22 14:50:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-09-22 14:50:40,230 INFO L504 BasicCegarLoop]: Found error trace [2021-09-22 14:50:40,230 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-09-22 14:50:40,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-09-22 14:50:40,231 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-09-22 14:50:40,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-09-22 14:50:40,231 INFO L82 PathProgramCache]: Analyzing trace with hash 718213703, now seen corresponding path program 2 times [2021-09-22 14:50:40,231 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-09-22 14:50:40,231 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086075273] [2021-09-22 14:50:40,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-09-22 14:50:40,231 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-09-22 14:50:40,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:50:40,256 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-09-22 14:50:40,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-09-22 14:50:40,314 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-09-22 14:50:40,315 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-09-22 14:50:40,318 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:50:40,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:50:40,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-09-22 14:50:40,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-09-22 14:50:40,320 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-09-22 14:50:40,321 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-09-22 14:50:40,321 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-09-22 14:50:40,325 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-09-22 14:50:40,325 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-09-22 14:50:40,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.09 02:50:40 BasicIcfg [2021-09-22 14:50:40,412 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-09-22 14:50:40,418 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-09-22 14:50:40,418 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-09-22 14:50:40,418 INFO L275 PluginConnector]: Witness Printer initialized [2021-09-22 14:50:40,419 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.09 02:50:22" (3/4) ... [2021-09-22 14:50:40,420 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-09-22 14:50:40,492 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-09-22 14:50:40,492 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-09-22 14:50:40,493 INFO L168 Benchmark]: Toolchain (without parser) took 19663.09 ms. Allocated memory was 52.4 MB in the beginning and 211.8 MB in the end (delta: 159.4 MB). Free memory was 28.3 MB in the beginning and 159.4 MB in the end (delta: -131.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,493 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 52.4 MB. Free memory was 34.6 MB in the beginning and 34.6 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-09-22 14:50:40,494 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.24 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 28.1 MB in the beginning and 39.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,494 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 69.2 MB. Free memory was 39.6 MB in the beginning and 50.2 MB in the end (delta: -10.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,494 INFO L168 Benchmark]: Boogie Preprocessor took 20.94 ms. Allocated memory is still 69.2 MB. Free memory was 50.2 MB in the beginning and 48.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,495 INFO L168 Benchmark]: RCFGBuilder took 1230.13 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 48.1 MB in the beginning and 37.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,495 INFO L168 Benchmark]: TraceAbstraction took 17969.74 ms. Allocated memory was 83.9 MB in the beginning and 211.8 MB in the end (delta: 127.9 MB). Free memory was 37.3 MB in the beginning and 172.0 MB in the end (delta: -134.7 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,495 INFO L168 Benchmark]: Witness Printer took 74.00 ms. Allocated memory is still 211.8 MB. Free memory was 172.0 MB in the beginning and 159.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. [2021-09-22 14:50:40,496 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.09 ms. Allocated memory is still 52.4 MB. Free memory was 34.6 MB in the beginning and 34.6 MB in the end (delta: 38.2 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 318.24 ms. Allocated memory was 52.4 MB in the beginning and 69.2 MB in the end (delta: 16.8 MB). Free memory was 28.1 MB in the beginning and 39.6 MB in the end (delta: -11.5 MB). Peak memory consumption was 8.0 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 40.44 ms. Allocated memory is still 69.2 MB. Free memory was 39.6 MB in the beginning and 50.2 MB in the end (delta: -10.5 MB). Peak memory consumption was 7.4 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 20.94 ms. Allocated memory is still 69.2 MB. Free memory was 50.2 MB in the beginning and 48.1 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1230.13 ms. Allocated memory was 69.2 MB in the beginning and 83.9 MB in the end (delta: 14.7 MB). Free memory was 48.1 MB in the beginning and 37.8 MB in the end (delta: 10.3 MB). Peak memory consumption was 29.3 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17969.74 ms. Allocated memory was 83.9 MB in the beginning and 211.8 MB in the end (delta: 127.9 MB). Free memory was 37.3 MB in the beginning and 172.0 MB in the end (delta: -134.7 MB). Peak memory consumption was 107.9 MB. Max. memory is 16.1 GB. * Witness Printer took 74.00 ms. Allocated memory is still 211.8 MB. Free memory was 172.0 MB in the beginning and 159.4 MB in the end (delta: 12.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15224.0ms, 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: 531, positive: 12, positive conditional: 0, positive unconditional: 12, negative: 518, negative conditional: 0, negative unconditional: 518, 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.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; [L711] 0 int __unbuffered_p2_EAX = 0; [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: 17780.0ms, OverallIterations: 16, TraceHistogramMax: 1, EmptinessCheckTime: 18.3ms, AutomataDifference: 592.8ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 15311.1ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 295 SDtfs, 365 SDslu, 371 SDs, 0 SdLazy, 238 SolverSat, 103 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 272.4ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 216.0ms Time, 0.0ms 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.0ms DumpTime, AutomataMinimizationStatistics: 149.1ms AutomataMinimizationTime, 15 MinimizatonAttempts, 88 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 34.9ms SsaConstructionTime, 415.6ms SatisfiabilityAnalysisTime, 938.1ms 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-09-22 14:50:40,535 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...