./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 20ed64ec 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/safe029_pso.oepc.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 a17df1fba77819f5184121d2d7522e7b6e3b3c7f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-20ed64e [2021-08-26 14:41:28,614 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-26 14:41:28,616 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-26 14:41:28,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-26 14:41:28,648 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-26 14:41:28,650 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-26 14:41:28,651 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-26 14:41:28,655 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-26 14:41:28,671 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-26 14:41:28,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-26 14:41:28,675 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-26 14:41:28,678 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-26 14:41:28,679 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-26 14:41:28,680 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-26 14:41:28,682 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-26 14:41:28,684 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-26 14:41:28,685 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-26 14:41:28,685 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-26 14:41:28,687 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-26 14:41:28,691 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-26 14:41:28,693 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-26 14:41:28,693 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-26 14:41:28,695 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-26 14:41:28,695 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-26 14:41:28,700 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-26 14:41:28,700 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-26 14:41:28,701 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-26 14:41:28,702 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-26 14:41:28,702 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-26 14:41:28,703 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-26 14:41:28,703 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-26 14:41:28,703 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-26 14:41:28,705 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-26 14:41:28,705 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-26 14:41:28,706 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-26 14:41:28,706 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-26 14:41:28,706 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-26 14:41:28,707 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-26 14:41:28,707 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-26 14:41:28,708 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-26 14:41:28,708 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-26 14:41:28,711 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-26 14:41:28,740 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-26 14:41:28,740 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-26 14:41:28,741 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-26 14:41:28,741 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-26 14:41:28,742 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-26 14:41:28,743 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-26 14:41:28,743 INFO L138 SettingsManager]: * Use SBE=true [2021-08-26 14:41:28,743 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-26 14:41:28,743 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-26 14:41:28,743 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-26 14:41:28,744 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-26 14:41:28,744 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-26 14:41:28,744 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-26 14:41:28,744 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-26 14:41:28,744 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-26 14:41:28,745 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-26 14:41:28,745 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-26 14:41:28,745 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-26 14:41:28,745 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-26 14:41:28,745 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-26 14:41:28,745 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-26 14:41:28,745 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-26 14:41:28,753 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:41:28,754 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-26 14:41:28,754 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-26 14:41:28,755 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-26 14:41:28,755 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-26 14:41:28,755 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-26 14:41:28,755 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-26 14:41:28,755 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-26 14:41:28,756 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 -> a17df1fba77819f5184121d2d7522e7b6e3b3c7f [2021-08-26 14:41:28,985 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-26 14:41:28,998 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-26 14:41:29,000 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-26 14:41:29,001 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-26 14:41:29,001 INFO L275 PluginConnector]: CDTParser initialized [2021-08-26 14:41:29,002 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i [2021-08-26 14:41:29,044 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2852171d3/bb0aa6246b794c0186f606db75b72fdf/FLAGd7ae416f5 [2021-08-26 14:41:29,469 INFO L306 CDTParser]: Found 1 translation units. [2021-08-26 14:41:29,470 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/safe029_pso.oepc.i [2021-08-26 14:41:29,481 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2852171d3/bb0aa6246b794c0186f606db75b72fdf/FLAGd7ae416f5 [2021-08-26 14:41:29,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2852171d3/bb0aa6246b794c0186f606db75b72fdf [2021-08-26 14:41:29,835 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-26 14:41:29,836 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-26 14:41:29,837 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-26 14:41:29,837 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-26 14:41:29,842 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-26 14:41:29,842 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:41:29" (1/1) ... [2021-08-26 14:41:29,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4929d3c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:29, skipping insertion in model container [2021-08-26 14:41:29,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.08 02:41:29" (1/1) ... [2021-08-26 14:41:29,848 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-26 14:41:29,878 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-26 14:41:29,963 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/safe029_pso.oepc.i[950,963] [2021-08-26 14:41:30,124 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:41:30,134 INFO L203 MainTranslator]: Completed pre-run [2021-08-26 14:41:30,145 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/safe029_pso.oepc.i[950,963] [2021-08-26 14:41:30,179 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-26 14:41:30,207 INFO L208 MainTranslator]: Completed translation [2021-08-26 14:41:30,208 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30 WrapperNode [2021-08-26 14:41:30,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-26 14:41:30,210 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-26 14:41:30,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-26 14:41:30,211 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-26 14:41:30,215 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,241 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,274 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-26 14:41:30,276 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-26 14:41:30,276 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-26 14:41:30,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-26 14:41:30,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,282 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,301 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,302 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,307 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,320 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,332 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-26 14:41:30,333 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-26 14:41:30,333 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-26 14:41:30,333 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-26 14:41:30,334 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (1/1) ... [2021-08-26 14:41:30,338 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-26 14:41:30,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-26 14:41:30,351 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-26 14:41:30,361 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-26 14:41:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-26 14:41:30,387 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-26 14:41:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-26 14:41:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-26 14:41:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-26 14:41:30,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-26 14:41:30,388 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-26 14:41:30,388 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-26 14:41:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-26 14:41:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-26 14:41:30,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-26 14:41:30,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-26 14:41:30,390 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-26 14:41:31,778 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-26 14:41:31,778 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-26 14:41:31,780 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:41:31 BoogieIcfgContainer [2021-08-26 14:41:31,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-26 14:41:31,781 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-26 14:41:31,781 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-26 14:41:31,783 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-26 14:41:31,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.08 02:41:29" (1/3) ... [2021-08-26 14:41:31,784 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f32d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:41:31, skipping insertion in model container [2021-08-26 14:41:31,784 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.08 02:41:30" (2/3) ... [2021-08-26 14:41:31,785 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@37f32d95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.08 02:41:31, skipping insertion in model container [2021-08-26 14:41:31,785 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:41:31" (3/3) ... [2021-08-26 14:41:31,788 INFO L111 eAbstractionObserver]: Analyzing ICFG safe029_pso.oepc.i [2021-08-26 14:41:31,792 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-26 14:41:31,792 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-26 14:41:31,792 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-26 14:41:31,792 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-26 14:41:31,812 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,813 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,813 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,814 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,815 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,816 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,817 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,818 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,818 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,819 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,820 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,821 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,822 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,823 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,825 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,825 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,825 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,826 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,832 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,833 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,833 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,834 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-26 14:41:31,835 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-26 14:41:31,862 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-26 14:41:31,866 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-26 14:41:31,866 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-08-26 14:41:31,876 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-26 14:41:31,886 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 90 places, 85 transitions, 180 flow [2021-08-26 14:41:31,888 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 90 places, 85 transitions, 180 flow [2021-08-26 14:41:31,889 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 90 places, 85 transitions, 180 flow [2021-08-26 14:41:31,909 INFO L129 PetriNetUnfolder]: 2/83 cut-off events. [2021-08-26 14:41:31,909 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-26 14:41:31,911 INFO L84 FinitePrefix]: Finished finitePrefix Result has 90 conditions, 83 events. 2/83 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 45 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2021-08-26 14:41:31,913 INFO L116 LiptonReduction]: Number of co-enabled transitions 1004 [2021-08-26 14:41:38,698 INFO L131 LiptonReduction]: Checked pairs total: 2376 [2021-08-26 14:41:38,698 INFO L133 LiptonReduction]: Total number of compositions: 75 [2021-08-26 14:41:38,703 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 27 places, 21 transitions, 52 flow [2021-08-26 14:41:38,718 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 174 states, 171 states have (on average 2.584795321637427) internal successors, (442), 173 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:38,720 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 171 states have (on average 2.584795321637427) internal successors, (442), 173 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:38,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-08-26 14:41:38,723 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:38,723 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-08-26 14:41:38,724 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P0Err0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:38,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:38,727 INFO L82 PathProgramCache]: Analyzing trace with hash 929067, now seen corresponding path program 1 times [2021-08-26 14:41:38,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:38,733 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023936120] [2021-08-26 14:41:38,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:38,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:38,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:38,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:38,876 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:38,876 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023936120] [2021-08-26 14:41:38,877 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023936120] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:38,877 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:38,877 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-26 14:41:38,878 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189149504] [2021-08-26 14:41:38,886 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-26 14:41:38,886 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:38,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-26 14:41:38,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:41:38,899 INFO L87 Difference]: Start difference. First operand has 174 states, 171 states have (on average 2.584795321637427) internal successors, (442), 173 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:38,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:38,944 INFO L93 Difference]: Finished difference Result 142 states and 329 transitions. [2021-08-26 14:41:38,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-26 14:41:38,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2021-08-26 14:41:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:38,951 INFO L225 Difference]: With dead ends: 142 [2021-08-26 14:41:38,951 INFO L226 Difference]: Without dead ends: 137 [2021-08-26 14:41:38,952 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-26 14:41:38,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2021-08-26 14:41:38,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2021-08-26 14:41:38,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 136 states have (on average 2.3529411764705883) internal successors, (320), 136 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:38,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 320 transitions. [2021-08-26 14:41:38,977 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 320 transitions. Word has length 3 [2021-08-26 14:41:38,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:38,977 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 320 transitions. [2021-08-26 14:41:38,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:38,978 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 320 transitions. [2021-08-26 14:41:38,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-08-26 14:41:38,978 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:38,978 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:38,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-26 14:41:38,979 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:38,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:38,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1578361230, now seen corresponding path program 1 times [2021-08-26 14:41:38,979 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:38,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090226199] [2021-08-26 14:41:38,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:38,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:39,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:39,106 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:39,106 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090226199] [2021-08-26 14:41:39,106 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090226199] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:39,106 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:39,106 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-26 14:41:39,106 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884858278] [2021-08-26 14:41:39,107 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:39,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:39,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:39,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:39,108 INFO L87 Difference]: Start difference. First operand 137 states and 320 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:39,134 INFO L93 Difference]: Finished difference Result 158 states and 350 transitions. [2021-08-26 14:41:39,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:39,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2021-08-26 14:41:39,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:39,136 INFO L225 Difference]: With dead ends: 158 [2021-08-26 14:41:39,137 INFO L226 Difference]: Without dead ends: 133 [2021-08-26 14:41:39,138 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.0ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:39,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2021-08-26 14:41:39,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2021-08-26 14:41:39,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 132 states have (on average 2.3333333333333335) internal successors, (308), 132 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 308 transitions. [2021-08-26 14:41:39,152 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 308 transitions. Word has length 8 [2021-08-26 14:41:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:39,152 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 308 transitions. [2021-08-26 14:41:39,152 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,153 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 308 transitions. [2021-08-26 14:41:39,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-08-26 14:41:39,154 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:39,154 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:39,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-26 14:41:39,154 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:39,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:39,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1684513001, now seen corresponding path program 1 times [2021-08-26 14:41:39,156 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:39,157 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192806775] [2021-08-26 14:41:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:39,157 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:39,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:39,315 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:39,315 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192806775] [2021-08-26 14:41:39,316 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192806775] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:39,316 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:39,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:39,317 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110391647] [2021-08-26 14:41:39,317 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:41:39,318 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:39,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:41:39,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:39,318 INFO L87 Difference]: Start difference. First operand 133 states and 308 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:39,369 INFO L93 Difference]: Finished difference Result 151 states and 334 transitions. [2021-08-26 14:41:39,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:39,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2021-08-26 14:41:39,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:39,371 INFO L225 Difference]: With dead ends: 151 [2021-08-26 14:41:39,371 INFO L226 Difference]: Without dead ends: 131 [2021-08-26 14:41:39,371 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 24.5ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-08-26 14:41:39,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2021-08-26 14:41:39,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 2.3230769230769233) internal successors, (302), 130 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 302 transitions. [2021-08-26 14:41:39,389 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 302 transitions. Word has length 9 [2021-08-26 14:41:39,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:39,390 INFO L470 AbstractCegarLoop]: Abstraction has 131 states and 302 transitions. [2021-08-26 14:41:39,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 302 transitions. [2021-08-26 14:41:39,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 14:41:39,391 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:39,391 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:39,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-26 14:41:39,391 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:39,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:39,392 INFO L82 PathProgramCache]: Analyzing trace with hash 1370317408, now seen corresponding path program 1 times [2021-08-26 14:41:39,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:39,392 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197274235] [2021-08-26 14:41:39,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:39,392 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:39,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:39,446 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:39,446 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197274235] [2021-08-26 14:41:39,446 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197274235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:39,446 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:39,446 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:39,446 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881873571] [2021-08-26 14:41:39,447 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:39,447 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:39,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:39,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:39,448 INFO L87 Difference]: Start difference. First operand 131 states and 302 transitions. Second operand has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:39,467 INFO L93 Difference]: Finished difference Result 212 states and 461 transitions. [2021-08-26 14:41:39,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:39,468 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 14:41:39,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:39,469 INFO L225 Difference]: With dead ends: 212 [2021-08-26 14:41:39,469 INFO L226 Difference]: Without dead ends: 149 [2021-08-26 14:41:39,470 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:39,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2021-08-26 14:41:39,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 125. [2021-08-26 14:41:39,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 2.2096774193548385) internal successors, (274), 124 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 274 transitions. [2021-08-26 14:41:39,479 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 274 transitions. Word has length 10 [2021-08-26 14:41:39,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:39,480 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 274 transitions. [2021-08-26 14:41:39,480 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,480 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 274 transitions. [2021-08-26 14:41:39,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-08-26 14:41:39,481 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:39,481 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:39,481 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-26 14:41:39,482 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:39,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:39,482 INFO L82 PathProgramCache]: Analyzing trace with hash -1648884171, now seen corresponding path program 1 times [2021-08-26 14:41:39,483 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:39,483 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947068806] [2021-08-26 14:41:39,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:39,483 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:39,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:39,672 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:39,672 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947068806] [2021-08-26 14:41:39,672 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947068806] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:39,672 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:39,672 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:41:39,673 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220679214] [2021-08-26 14:41:39,673 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:41:39,673 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:41:39,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:39,674 INFO L87 Difference]: Start difference. First operand 125 states and 274 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:39,811 INFO L93 Difference]: Finished difference Result 143 states and 298 transitions. [2021-08-26 14:41:39,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:41:39,812 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2021-08-26 14:41:39,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:39,813 INFO L225 Difference]: With dead ends: 143 [2021-08-26 14:41:39,813 INFO L226 Difference]: Without dead ends: 122 [2021-08-26 14:41:39,814 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 95.1ms TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:41:39,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2021-08-26 14:41:39,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2021-08-26 14:41:39,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 121 states have (on average 2.1487603305785123) internal successors, (260), 121 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 260 transitions. [2021-08-26 14:41:39,818 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 260 transitions. Word has length 10 [2021-08-26 14:41:39,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:39,818 INFO L470 AbstractCegarLoop]: Abstraction has 122 states and 260 transitions. [2021-08-26 14:41:39,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,818 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 260 transitions. [2021-08-26 14:41:39,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:41:39,819 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:39,819 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:39,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-26 14:41:39,819 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:39,820 INFO L82 PathProgramCache]: Analyzing trace with hash -387751632, now seen corresponding path program 1 times [2021-08-26 14:41:39,820 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:39,820 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724790037] [2021-08-26 14:41:39,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:39,820 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:39,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:39,906 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:39,908 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724790037] [2021-08-26 14:41:39,908 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724790037] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:39,909 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:39,909 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:41:39,909 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300152404] [2021-08-26 14:41:39,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-26 14:41:39,909 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-26 14:41:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:39,910 INFO L87 Difference]: Start difference. First operand 122 states and 260 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:39,957 INFO L93 Difference]: Finished difference Result 136 states and 281 transitions. [2021-08-26 14:41:39,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:39,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:41:39,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:39,959 INFO L225 Difference]: With dead ends: 136 [2021-08-26 14:41:39,959 INFO L226 Difference]: Without dead ends: 124 [2021-08-26 14:41:39,959 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 16.6ms TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:39,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2021-08-26 14:41:39,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2021-08-26 14:41:39,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 122 states have (on average 2.1475409836065573) internal successors, (262), 122 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 262 transitions. [2021-08-26 14:41:39,963 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 262 transitions. Word has length 11 [2021-08-26 14:41:39,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:39,963 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 262 transitions. [2021-08-26 14:41:39,963 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:39,963 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 262 transitions. [2021-08-26 14:41:39,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:41:39,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:39,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:39,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-26 14:41:39,964 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:39,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:39,965 INFO L82 PathProgramCache]: Analyzing trace with hash -387788150, now seen corresponding path program 1 times [2021-08-26 14:41:39,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:39,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031783182] [2021-08-26 14:41:39,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:39,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:40,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:40,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:40,119 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031783182] [2021-08-26 14:41:40,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031783182] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:40,119 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:40,119 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:41:40,119 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344788991] [2021-08-26 14:41:40,119 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:41:40,119 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:40,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:41:40,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:40,120 INFO L87 Difference]: Start difference. First operand 123 states and 262 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:40,197 INFO L93 Difference]: Finished difference Result 129 states and 267 transitions. [2021-08-26 14:41:40,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:40,197 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:41:40,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:40,198 INFO L225 Difference]: With dead ends: 129 [2021-08-26 14:41:40,198 INFO L226 Difference]: Without dead ends: 119 [2021-08-26 14:41:40,198 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 69.1ms TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2021-08-26 14:41:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2021-08-26 14:41:40,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2021-08-26 14:41:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 2.135593220338983) internal successors, (252), 118 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 252 transitions. [2021-08-26 14:41:40,201 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 252 transitions. Word has length 11 [2021-08-26 14:41:40,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:40,202 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 252 transitions. [2021-08-26 14:41:40,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 252 transitions. [2021-08-26 14:41:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:41:40,202 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:40,203 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:40,203 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-26 14:41:40,203 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:40,203 INFO L82 PathProgramCache]: Analyzing trace with hash -1122628332, now seen corresponding path program 2 times [2021-08-26 14:41:40,203 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:40,204 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753529483] [2021-08-26 14:41:40,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:40,204 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:40,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:40,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:40,301 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:40,301 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753529483] [2021-08-26 14:41:40,301 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753529483] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:40,301 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:40,301 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:41:40,302 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465109706] [2021-08-26 14:41:40,302 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:41:40,302 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:40,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:41:40,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:41:40,303 INFO L87 Difference]: Start difference. First operand 119 states and 252 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:40,412 INFO L93 Difference]: Finished difference Result 133 states and 272 transitions. [2021-08-26 14:41:40,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-26 14:41:40,412 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:41:40,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:40,413 INFO L225 Difference]: With dead ends: 133 [2021-08-26 14:41:40,413 INFO L226 Difference]: Without dead ends: 121 [2021-08-26 14:41:40,413 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 56.3ms TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:41:40,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2021-08-26 14:41:40,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 117. [2021-08-26 14:41:40,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 116 states have (on average 2.1379310344827585) internal successors, (248), 116 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 248 transitions. [2021-08-26 14:41:40,416 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 248 transitions. Word has length 11 [2021-08-26 14:41:40,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:40,416 INFO L470 AbstractCegarLoop]: Abstraction has 117 states and 248 transitions. [2021-08-26 14:41:40,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 248 transitions. [2021-08-26 14:41:40,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-08-26 14:41:40,417 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:40,417 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:40,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-26 14:41:40,418 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:40,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:40,418 INFO L82 PathProgramCache]: Analyzing trace with hash -1122397692, now seen corresponding path program 3 times [2021-08-26 14:41:40,418 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:40,418 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211232400] [2021-08-26 14:41:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:40,419 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:40,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:40,546 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:40,546 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211232400] [2021-08-26 14:41:40,546 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211232400] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:40,546 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:40,546 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-26 14:41:40,546 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777558362] [2021-08-26 14:41:40,547 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-26 14:41:40,547 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:40,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-26 14:41:40,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-26 14:41:40,547 INFO L87 Difference]: Start difference. First operand 117 states and 248 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:40,623 INFO L93 Difference]: Finished difference Result 138 states and 275 transitions. [2021-08-26 14:41:40,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-26 14:41:40,624 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2021-08-26 14:41:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:40,624 INFO L225 Difference]: With dead ends: 138 [2021-08-26 14:41:40,624 INFO L226 Difference]: Without dead ends: 110 [2021-08-26 14:41:40,625 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 41.1ms TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:41:40,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2021-08-26 14:41:40,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 105. [2021-08-26 14:41:40,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 2.0961538461538463) internal successors, (218), 104 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 218 transitions. [2021-08-26 14:41:40,627 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 218 transitions. Word has length 11 [2021-08-26 14:41:40,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:40,628 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 218 transitions. [2021-08-26 14:41:40,628 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,628 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 218 transitions. [2021-08-26 14:41:40,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-26 14:41:40,628 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:40,629 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:40,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-26 14:41:40,629 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:40,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:40,629 INFO L82 PathProgramCache]: Analyzing trace with hash -832587948, now seen corresponding path program 1 times [2021-08-26 14:41:40,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:40,630 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278489065] [2021-08-26 14:41:40,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:40,630 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:40,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:40,675 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:40,675 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278489065] [2021-08-26 14:41:40,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278489065] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:40,675 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:40,676 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-26 14:41:40,676 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998297228] [2021-08-26 14:41:40,676 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-26 14:41:40,676 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:40,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-26 14:41:40,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-26 14:41:40,677 INFO L87 Difference]: Start difference. First operand 105 states and 218 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:40,693 INFO L93 Difference]: Finished difference Result 88 states and 153 transitions. [2021-08-26 14:41:40,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-26 14:41:40,694 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-26 14:41:40,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:40,694 INFO L225 Difference]: With dead ends: 88 [2021-08-26 14:41:40,694 INFO L226 Difference]: Without dead ends: 65 [2021-08-26 14:41:40,695 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:40,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2021-08-26 14:41:40,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2021-08-26 14:41:40,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.65625) internal successors, (106), 64 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 106 transitions. [2021-08-26 14:41:40,697 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 106 transitions. Word has length 12 [2021-08-26 14:41:40,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:40,697 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 106 transitions. [2021-08-26 14:41:40,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,697 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 106 transitions. [2021-08-26 14:41:40,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-26 14:41:40,698 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:40,698 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:40,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-26 14:41:40,698 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:40,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:40,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1344468571, now seen corresponding path program 1 times [2021-08-26 14:41:40,699 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:40,699 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194467230] [2021-08-26 14:41:40,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:40,699 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:40,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:40,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:40,742 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:40,742 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194467230] [2021-08-26 14:41:40,742 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194467230] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:40,742 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:40,742 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-26 14:41:40,743 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782637306] [2021-08-26 14:41:40,743 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-26 14:41:40,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:40,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-26 14:41:40,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-26 14:41:40,744 INFO L87 Difference]: Start difference. First operand 65 states and 106 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:40,765 INFO L93 Difference]: Finished difference Result 47 states and 69 transitions. [2021-08-26 14:41:40,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:40,766 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-26 14:41:40,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:40,766 INFO L225 Difference]: With dead ends: 47 [2021-08-26 14:41:40,766 INFO L226 Difference]: Without dead ends: 33 [2021-08-26 14:41:40,767 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 14.1ms TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2021-08-26 14:41:40,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-08-26 14:41:40,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-08-26 14:41:40,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.5) internal successors, (48), 32 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 48 transitions. [2021-08-26 14:41:40,768 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 48 transitions. Word has length 13 [2021-08-26 14:41:40,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:40,768 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 48 transitions. [2021-08-26 14:41:40,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 48 transitions. [2021-08-26 14:41:40,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 14:41:40,769 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:40,769 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:40,769 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-26 14:41:40,769 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:40,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:40,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1250831605, now seen corresponding path program 1 times [2021-08-26 14:41:40,770 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:40,770 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647066000] [2021-08-26 14:41:40,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:40,770 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-26 14:41:40,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-26 14:41:40,900 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-26 14:41:40,901 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647066000] [2021-08-26 14:41:40,901 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647066000] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-26 14:41:40,901 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-26 14:41:40,901 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-26 14:41:40,901 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674886311] [2021-08-26 14:41:40,901 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-26 14:41:40,901 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-26 14:41:40,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-26 14:41:40,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-26 14:41:40,902 INFO L87 Difference]: Start difference. First operand 33 states and 48 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-26 14:41:40,963 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2021-08-26 14:41:40,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-26 14:41:40,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2021-08-26 14:41:40,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-26 14:41:40,964 INFO L225 Difference]: With dead ends: 42 [2021-08-26 14:41:40,964 INFO L226 Difference]: Without dead ends: 25 [2021-08-26 14:41:40,964 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 61.5ms TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2021-08-26 14:41:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-08-26 14:41:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-08-26 14:41:40,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2021-08-26 14:41:40,965 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 16 [2021-08-26 14:41:40,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-26 14:41:40,966 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions. [2021-08-26 14:41:40,966 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-26 14:41:40,966 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions. [2021-08-26 14:41:40,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-26 14:41:40,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-26 14:41:40,966 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-26 14:41:40,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-26 14:41:40,966 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 2 more)] === [2021-08-26 14:41:40,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-26 14:41:40,967 INFO L82 PathProgramCache]: Analyzing trace with hash -987164621, now seen corresponding path program 2 times [2021-08-26 14:41:40,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-26 14:41:40,967 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705088810] [2021-08-26 14:41:40,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-26 14:41:40,967 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-26 14:41:40,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:41:40,986 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-26 14:41:41,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-26 14:41:41,028 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-26 14:41:41,028 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-26 14:41:41,029 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:41:41,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:41:41,030 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-26 14:41:41,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-26 14:41:41,031 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-26 14:41:41,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-26 14:41:41,035 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-26 14:41:41,035 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-26 14:41:41,067 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.08 02:41:41 BasicIcfg [2021-08-26 14:41:41,074 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-26 14:41:41,074 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-26 14:41:41,074 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-26 14:41:41,074 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-26 14:41:41,075 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.08 02:41:31" (3/4) ... [2021-08-26 14:41:41,076 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-26 14:41:41,132 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-26 14:41:41,133 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-26 14:41:41,133 INFO L168 Benchmark]: Toolchain (without parser) took 11296.68 ms. Allocated memory was 54.5 MB in the beginning and 274.7 MB in the end (delta: 220.2 MB). Free memory was 32.2 MB in the beginning and 112.2 MB in the end (delta: -80.0 MB). Peak memory consumption was 140.8 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,134 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.6 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-08-26 14:41:41,134 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.46 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.9 MB in the beginning and 38.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,134 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.20 ms. Allocated memory is still 67.1 MB. Free memory was 38.6 MB in the beginning and 35.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,134 INFO L168 Benchmark]: Boogie Preprocessor took 56.34 ms. Allocated memory is still 67.1 MB. Free memory was 35.9 MB in the beginning and 47.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,135 INFO L168 Benchmark]: RCFGBuilder took 1447.34 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 47.7 MB in the beginning and 59.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,135 INFO L168 Benchmark]: TraceAbstraction took 9292.50 ms. Allocated memory was 98.6 MB in the beginning and 274.7 MB in the end (delta: 176.2 MB). Free memory was 58.3 MB in the beginning and 120.6 MB in the end (delta: -62.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,135 INFO L168 Benchmark]: Witness Printer took 58.42 ms. Allocated memory is still 274.7 MB. Free memory was 120.6 MB in the beginning and 112.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-08-26 14:41:41,136 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.14 ms. Allocated memory is still 54.5 MB. Free memory was 36.7 MB in the beginning and 36.6 MB in the end (delta: 73.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 372.46 ms. Allocated memory was 54.5 MB in the beginning and 67.1 MB in the end (delta: 12.6 MB). Free memory was 31.9 MB in the beginning and 38.8 MB in the end (delta: -6.9 MB). Peak memory consumption was 9.6 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 65.20 ms. Allocated memory is still 67.1 MB. Free memory was 38.6 MB in the beginning and 35.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.34 ms. Allocated memory is still 67.1 MB. Free memory was 35.9 MB in the beginning and 47.7 MB in the end (delta: -11.7 MB). Peak memory consumption was 7.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1447.34 ms. Allocated memory was 67.1 MB in the beginning and 98.6 MB in the end (delta: 31.5 MB). Free memory was 47.7 MB in the beginning and 59.0 MB in the end (delta: -11.4 MB). Peak memory consumption was 36.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 9292.50 ms. Allocated memory was 98.6 MB in the beginning and 274.7 MB in the end (delta: 176.2 MB). Free memory was 58.3 MB in the beginning and 120.6 MB in the end (delta: -62.3 MB). Peak memory consumption was 114.3 MB. Max. memory is 16.1 GB. * Witness Printer took 58.42 ms. Allocated memory is still 274.7 MB. Free memory was 120.6 MB in the beginning and 112.2 MB in the end (delta: 8.4 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6810.5ms, 90 PlacesBefore, 27 PlacesAfterwards, 85 TransitionsBefore, 21 TransitionsAfterwards, 1004 CoEnabledTransitionPairs, 6 FixpointIterations, 33 TrivialSequentialCompositions, 34 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 7 ConcurrentYvCompositions, 1 ChoiceCompositions, 75 TotalNumberOfCompositions, 2376 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 1286, positive: 1183, positive conditional: 0, positive unconditional: 1183, negative: 103, negative conditional: 0, negative unconditional: 103, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 723, positive: 689, positive conditional: 0, positive unconditional: 689, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 723, positive: 665, positive conditional: 0, positive unconditional: 665, negative: 58, negative conditional: 0, negative unconditional: 58, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 58, positive: 24, positive conditional: 0, positive unconditional: 24, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 263, positive: 31, positive conditional: 0, positive unconditional: 31, negative: 233, negative conditional: 0, negative unconditional: 233, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 1286, positive: 494, positive conditional: 0, positive unconditional: 494, negative: 69, negative conditional: 0, negative unconditional: 69, unknown: 723, unknown conditional: 0, unknown unconditional: 723] , Statistics on independence cache: Total cache size (in pairs): 86, Positive cache size: 73, Positive conditional cache size: 0, Positive unconditional cache size: 73, Negative cache size: 13, Negative conditional cache size: 0, Negative unconditional cache size: 13 - 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: [L708] 0 int __unbuffered_cnt = 0; [L709] 0 _Bool main$tmp_guard0; [L710] 0 _Bool main$tmp_guard1; [L712] 0 int x = 0; [L714] 0 int y = 0; [L715] 0 _Bool y$flush_delayed; [L716] 0 int y$mem_tmp; [L717] 0 _Bool y$r_buff0_thd0; [L718] 0 _Bool y$r_buff0_thd1; [L719] 0 _Bool y$r_buff0_thd2; [L720] 0 _Bool y$r_buff1_thd0; [L721] 0 _Bool y$r_buff1_thd1; [L722] 0 _Bool y$r_buff1_thd2; [L723] 0 _Bool y$read_delayed; [L724] 0 int *y$read_delayed_var; [L725] 0 int y$w_buff0; [L726] 0 _Bool y$w_buff0_used; [L727] 0 int y$w_buff1; [L728] 0 _Bool y$w_buff1_used; [L729] 0 _Bool weak$$choice0; [L730] 0 _Bool weak$$choice2; [L790] 0 pthread_t t2477; [L791] FCALL, FORK 0 pthread_create(&t2477, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L734] 1 y$w_buff1 = y$w_buff0 [L735] 1 y$w_buff0 = 2 [L736] 1 y$w_buff1_used = y$w_buff0_used [L737] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L739] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L740] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L741] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L742] 1 y$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L745] 1 x = 1 VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L792] 0 pthread_t t2478; [L793] FCALL, FORK 0 pthread_create(&t2478, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L762] 2 x = 2 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L765] 2 y = 1 VAL [__unbuffered_cnt=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L748] 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) [L748] 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) [L749] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L749] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L750] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L750] 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 [L751] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L751] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L752] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L752] 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 [L768] 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) [L768] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L768] 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) [L768] 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) [L769] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L769] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L770] 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 [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L771] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L772] 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 [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L777] 2 return 0; [L755] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L757] 1 return 0; [L795] 0 main$tmp_guard0 = __unbuffered_cnt == 2 [L3] COND FALSE 0 !(!cond) [L799] 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) [L799] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L799] 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) [L799] 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) [L800] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L800] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L801] 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 [L802] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L802] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L803] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L803] 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 [L806] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L807] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L808] 0 y$flush_delayed = weak$$choice2 [L809] 0 y$mem_tmp = y [L810] 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) [L810] 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) [L811] 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)) [L811] 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)) [L812] 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)) [L812] 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)) [L813] 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)) [L813] 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)) [L814] 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)) [L814] 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)) [L815] 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)) [L815] 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)) [L816] 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)) [L816] 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)) [L817] 0 main$tmp_guard1 = !(x == 2 && y == 2) [L818] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L818] 0 y = y$flush_delayed ? y$mem_tmp : y [L819] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, __unbuffered_cnt=2, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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: 793]: 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: 791]: 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 5 procedures, 103 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 9171.9ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 12.1ms, AutomataDifference: 735.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 6851.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 220 SDtfs, 201 SDslu, 441 SDs, 0 SdLazy, 384 SolverSat, 83 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 386.9ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 415.3ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=174occurred in iteration=0, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 78.0ms AutomataMinimizationTime, 12 MinimizatonAttempts, 34 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 24.7ms SsaConstructionTime, 333.3ms SatisfiabilityAnalysisTime, 922.6ms InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 113 ConstructedInterpolants, 0 QuantifiedInterpolants, 1163 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-26 14:41:41,170 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...