./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5fbdf5bf Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ee8d2d4036b1590dd429e125dca0467c8278ce64 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.1-wip.dd.seqcomp-5fbdf5b [2021-08-29 22:13:33,058 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-29 22:13:33,060 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-29 22:13:33,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-29 22:13:33,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-29 22:13:33,097 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-29 22:13:33,098 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-29 22:13:33,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-29 22:13:33,104 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-29 22:13:33,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-29 22:13:33,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-29 22:13:33,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-29 22:13:33,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-29 22:13:33,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-29 22:13:33,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-29 22:13:33,119 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-29 22:13:33,119 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-29 22:13:33,120 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-29 22:13:33,121 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-29 22:13:33,122 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-29 22:13:33,122 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-29 22:13:33,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-29 22:13:33,132 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-29 22:13:33,133 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-29 22:13:33,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-29 22:13:33,139 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-29 22:13:33,139 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-29 22:13:33,140 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-29 22:13:33,141 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-29 22:13:33,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-29 22:13:33,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-29 22:13:33,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-29 22:13:33,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-29 22:13:33,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-29 22:13:33,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-29 22:13:33,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-29 22:13:33,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-29 22:13:33,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-29 22:13:33,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-29 22:13:33,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-29 22:13:33,147 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-29 22:13:33,150 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-08-29 22:13:33,184 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-29 22:13:33,184 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-29 22:13:33,185 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-08-29 22:13:33,185 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-08-29 22:13:33,187 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-29 22:13:33,187 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-29 22:13:33,187 INFO L138 SettingsManager]: * Use SBE=true [2021-08-29 22:13:33,187 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-29 22:13:33,187 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-29 22:13:33,187 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-29 22:13:33,188 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-29 22:13:33,189 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:13:33,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-29 22:13:33,189 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-29 22:13:33,190 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-08-29 22:13:33,190 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 -> ee8d2d4036b1590dd429e125dca0467c8278ce64 [2021-08-29 22:13:33,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-29 22:13:33,484 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-29 22:13:33,486 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-29 22:13:33,486 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-29 22:13:33,487 INFO L275 PluginConnector]: CDTParser initialized [2021-08-29 22:13:33,488 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i [2021-08-29 22:13:33,533 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be41ea140/2ee4f1fd79094b4298aa92c3eadb95f9/FLAG712725b74 [2021-08-29 22:13:33,959 INFO L306 CDTParser]: Found 1 translation units. [2021-08-29 22:13:33,959 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-wmm/mix030_pso.opt.i [2021-08-29 22:13:33,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be41ea140/2ee4f1fd79094b4298aa92c3eadb95f9/FLAG712725b74 [2021-08-29 22:13:34,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be41ea140/2ee4f1fd79094b4298aa92c3eadb95f9 [2021-08-29 22:13:34,287 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-29 22:13:34,288 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-08-29 22:13:34,289 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-29 22:13:34,289 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-29 22:13:34,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-29 22:13:34,292 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,293 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e21523a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34, skipping insertion in model container [2021-08-29 22:13:34,293 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-29 22:13:34,320 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-29 22:13:34,412 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/mix030_pso.opt.i[948,961] [2021-08-29 22:13:34,599 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:13:34,604 INFO L203 MainTranslator]: Completed pre-run [2021-08-29 22:13:34,617 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/mix030_pso.opt.i[948,961] [2021-08-29 22:13:34,645 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-29 22:13:34,669 INFO L208 MainTranslator]: Completed translation [2021-08-29 22:13:34,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34 WrapperNode [2021-08-29 22:13:34,670 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-29 22:13:34,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-29 22:13:34,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-29 22:13:34,671 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-29 22:13:34,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,685 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,706 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-29 22:13:34,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-29 22:13:34,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-29 22:13:34,707 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-29 22:13:34,713 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,729 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-29 22:13:34,730 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-29 22:13:34,730 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-29 22:13:34,730 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-29 22:13:34,731 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (1/1) ... [2021-08-29 22:13:34,735 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-29 22:13:34,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-29 22:13:34,751 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-08-29 22:13:34,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-08-29 22:13:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-29 22:13:34,779 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-29 22:13:34,780 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-29 22:13:34,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-29 22:13:34,780 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-29 22:13:34,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-29 22:13:34,780 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-29 22:13:34,780 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-29 22:13:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-29 22:13:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-29 22:13:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-08-29 22:13:34,781 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-08-29 22:13:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-29 22:13:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-29 22:13:34,781 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-29 22:13:34,782 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-29 22:13:34,783 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-29 22:13:35,270 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-29 22:13:35,271 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-29 22:13:35,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:35 BoogieIcfgContainer [2021-08-29 22:13:35,273 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-29 22:13:35,274 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-29 22:13:35,274 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-29 22:13:35,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-29 22:13:35,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 10:13:34" (1/3) ... [2021-08-29 22:13:35,276 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c72b712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:35, skipping insertion in model container [2021-08-29 22:13:35,276 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 10:13:34" (2/3) ... [2021-08-29 22:13:35,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c72b712 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 10:13:35, skipping insertion in model container [2021-08-29 22:13:35,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:35" (3/3) ... [2021-08-29 22:13:35,278 INFO L111 eAbstractionObserver]: Analyzing ICFG mix030_pso.opt.i [2021-08-29 22:13:35,281 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-29 22:13:35,281 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-29 22:13:35,281 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-29 22:13:35,281 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-29 22:13:35,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,310 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,310 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,311 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,311 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,311 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,312 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,312 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,312 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,313 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,313 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,314 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,315 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,324 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,325 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,326 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,326 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,326 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,327 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,328 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,328 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,328 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,328 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,329 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,330 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,331 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,332 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,333 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,334 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,335 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,338 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,339 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,339 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,340 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,340 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,340 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,341 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,342 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,344 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,344 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-29 22:13:35,345 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-29 22:13:35,373 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-29 22:13:35,379 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-08-29 22:13:35,379 INFO L340 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2021-08-29 22:13:35,389 INFO L118 etLargeBlockEncoding]: Petri net LBE is using semantic-based independence relation. [2021-08-29 22:13:35,397 INFO L133 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 127 transitions, 274 flow [2021-08-29 22:13:35,398 INFO L110 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 127 transitions, 274 flow [2021-08-29 22:13:35,399 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 138 places, 127 transitions, 274 flow [2021-08-29 22:13:35,432 INFO L129 PetriNetUnfolder]: 2/123 cut-off events. [2021-08-29 22:13:35,433 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2021-08-29 22:13:35,436 INFO L84 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 123 events. 2/123 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 69 event pairs, 0 based on Foata normal form. 0/119 useless extension candidates. Maximal degree in co-relation 86. Up to 2 conditions per place. [2021-08-29 22:13:35,438 INFO L116 LiptonReduction]: Number of co-enabled transitions 2928 [2021-08-29 22:13:41,716 INFO L131 LiptonReduction]: Checked pairs total: 7994 [2021-08-29 22:13:41,717 INFO L133 LiptonReduction]: Total number of compositions: 105 [2021-08-29 22:13:41,723 INFO L111 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 47 places, 35 transitions, 90 flow [2021-08-29 22:13:41,930 INFO L133 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:41,939 INFO L276 IsEmpty]: Start isEmpty. Operand has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:41,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-08-29 22:13:41,945 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:41,946 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:41,946 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:41,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:41,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1763146594, now seen corresponding path program 1 times [2021-08-29 22:13:41,957 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:41,957 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745952676] [2021-08-29 22:13:41,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:41,958 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:42,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:42,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:42,102 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:42,102 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745952676] [2021-08-29 22:13:42,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745952676] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:42,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:42,103 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-08-29 22:13:42,104 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885353566] [2021-08-29 22:13:42,106 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:13:42,107 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:42,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:13:42,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:42,130 INFO L87 Difference]: Start difference. First operand has 4130 states, 4127 states have (on average 4.1293918100315) internal successors, (17042), 4129 states have internal predecessors, (17042), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:42,206 INFO L93 Difference]: Finished difference Result 3370 states and 13144 transitions. [2021-08-29 22:13:42,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:13:42,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2021-08-29 22:13:42,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:42,235 INFO L225 Difference]: With dead ends: 3370 [2021-08-29 22:13:42,235 INFO L226 Difference]: Without dead ends: 3250 [2021-08-29 22:13:42,236 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.22ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:42,238 INFO L928 BasicCegarLoop]: 13 mSDtfsCounter, 15 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 24.79ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.55ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 30.56ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:42,239 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 23 Invalid, 32 Unknown, 0 Unchecked, 0.55ms Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 30.56ms Time] [2021-08-29 22:13:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3250 states. [2021-08-29 22:13:42,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3250 to 3250. [2021-08-29 22:13:42,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3250 states, 3249 states have (on average 3.920590951061865) internal successors, (12738), 3249 states have internal predecessors, (12738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3250 states to 3250 states and 12738 transitions. [2021-08-29 22:13:42,385 INFO L78 Accepts]: Start accepts. Automaton has 3250 states and 12738 transitions. Word has length 7 [2021-08-29 22:13:42,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:42,386 INFO L470 AbstractCegarLoop]: Abstraction has 3250 states and 12738 transitions. [2021-08-29 22:13:42,386 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3250 states and 12738 transitions. [2021-08-29 22:13:42,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-08-29 22:13:42,389 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:42,389 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:42,389 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-29 22:13:42,390 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:42,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:42,390 INFO L82 PathProgramCache]: Analyzing trace with hash -364657913, now seen corresponding path program 1 times [2021-08-29 22:13:42,390 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:42,391 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621201865] [2021-08-29 22:13:42,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:42,391 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:42,483 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:42,483 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:42,484 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621201865] [2021-08-29 22:13:42,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621201865] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:42,484 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:42,484 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:42,484 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620476210] [2021-08-29 22:13:42,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:42,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:42,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:42,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:42,486 INFO L87 Difference]: Start difference. First operand 3250 states and 12738 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:42,567 INFO L93 Difference]: Finished difference Result 3770 states and 14324 transitions. [2021-08-29 22:13:42,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:42,568 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-08-29 22:13:42,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:42,586 INFO L225 Difference]: With dead ends: 3770 [2021-08-29 22:13:42,586 INFO L226 Difference]: Without dead ends: 3170 [2021-08-29 22:13:42,587 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.94ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:42,588 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 35 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.37ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.84ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.24ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:42,588 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 52 Invalid, 58 Unknown, 0 Unchecked, 0.84ms Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 46.24ms Time] [2021-08-29 22:13:42,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3170 states. [2021-08-29 22:13:42,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3170 to 3170. [2021-08-29 22:13:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3169 states have (on average 3.904701798674661) internal successors, (12374), 3169 states have internal predecessors, (12374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 12374 transitions. [2021-08-29 22:13:42,695 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 12374 transitions. Word has length 12 [2021-08-29 22:13:42,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:42,696 INFO L470 AbstractCegarLoop]: Abstraction has 3170 states and 12374 transitions. [2021-08-29 22:13:42,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,697 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 12374 transitions. [2021-08-29 22:13:42,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-08-29 22:13:42,699 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:42,699 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:42,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-29 22:13:42,699 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:42,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:42,700 INFO L82 PathProgramCache]: Analyzing trace with hash 1580519167, now seen corresponding path program 1 times [2021-08-29 22:13:42,700 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:42,700 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838090235] [2021-08-29 22:13:42,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:42,700 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:42,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:42,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:42,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:42,749 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838090235] [2021-08-29 22:13:42,750 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838090235] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:42,750 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:42,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:42,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405220096] [2021-08-29 22:13:42,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:42,751 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:42,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:42,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:42,751 INFO L87 Difference]: Start difference. First operand 3170 states and 12374 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:42,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:42,866 INFO L93 Difference]: Finished difference Result 3618 states and 13682 transitions. [2021-08-29 22:13:42,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:42,867 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-08-29 22:13:42,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:42,882 INFO L225 Difference]: With dead ends: 3618 [2021-08-29 22:13:42,883 INFO L226 Difference]: Without dead ends: 3058 [2021-08-29 22:13:42,883 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.31ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:42,884 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 69.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.77ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 78.01ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:42,884 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 54 Invalid, 60 Unknown, 0 Unchecked, 0.77ms Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 78.01ms Time] [2021-08-29 22:13:42,890 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3058 states. [2021-08-29 22:13:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3058 to 3058. [2021-08-29 22:13:42,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3058 states, 3057 states have (on average 3.878966306836768) internal successors, (11858), 3057 states have internal predecessors, (11858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3058 states to 3058 states and 11858 transitions. [2021-08-29 22:13:43,005 INFO L78 Accepts]: Start accepts. Automaton has 3058 states and 11858 transitions. Word has length 13 [2021-08-29 22:13:43,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:43,005 INFO L470 AbstractCegarLoop]: Abstraction has 3058 states and 11858 transitions. [2021-08-29 22:13:43,006 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,006 INFO L276 IsEmpty]: Start isEmpty. Operand 3058 states and 11858 transitions. [2021-08-29 22:13:43,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2021-08-29 22:13:43,008 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:43,008 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:43,008 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-29 22:13:43,008 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:43,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:43,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1958089549, now seen corresponding path program 1 times [2021-08-29 22:13:43,009 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:43,009 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783330462] [2021-08-29 22:13:43,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:43,010 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:43,066 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:43,067 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:43,067 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783330462] [2021-08-29 22:13:43,067 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783330462] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:43,067 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:43,067 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:43,067 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567762821] [2021-08-29 22:13:43,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:43,068 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:43,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:43,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:43,069 INFO L87 Difference]: Start difference. First operand 3058 states and 11858 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:43,144 INFO L93 Difference]: Finished difference Result 3274 states and 12344 transitions. [2021-08-29 22:13:43,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:43,145 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2021-08-29 22:13:43,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:43,159 INFO L225 Difference]: With dead ends: 3274 [2021-08-29 22:13:43,159 INFO L226 Difference]: Without dead ends: 2770 [2021-08-29 22:13:43,159 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.33ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:43,160 INFO L928 BasicCegarLoop]: 22 mSDtfsCounter, 38 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.33ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.80ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 45.70ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:43,160 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 51 Invalid, 55 Unknown, 0 Unchecked, 0.80ms Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 45.70ms Time] [2021-08-29 22:13:43,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2770 states. [2021-08-29 22:13:43,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2770 to 2770. [2021-08-29 22:13:43,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2770 states, 2769 states have (on average 3.84037558685446) internal successors, (10634), 2769 states have internal predecessors, (10634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2770 states to 2770 states and 10634 transitions. [2021-08-29 22:13:43,259 INFO L78 Accepts]: Start accepts. Automaton has 2770 states and 10634 transitions. Word has length 14 [2021-08-29 22:13:43,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:43,259 INFO L470 AbstractCegarLoop]: Abstraction has 2770 states and 10634 transitions. [2021-08-29 22:13:43,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,259 INFO L276 IsEmpty]: Start isEmpty. Operand 2770 states and 10634 transitions. [2021-08-29 22:13:43,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2021-08-29 22:13:43,261 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:43,262 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:43,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-29 22:13:43,262 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:43,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:43,262 INFO L82 PathProgramCache]: Analyzing trace with hash 571200329, now seen corresponding path program 1 times [2021-08-29 22:13:43,263 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:43,263 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665213046] [2021-08-29 22:13:43,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:43,263 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:43,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:43,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:43,489 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:43,489 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665213046] [2021-08-29 22:13:43,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665213046] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:43,489 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:43,489 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:43,489 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243916481] [2021-08-29 22:13:43,490 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:43,490 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:43,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:43,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:43,491 INFO L87 Difference]: Start difference. First operand 2770 states and 10634 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:43,590 INFO L93 Difference]: Finished difference Result 3082 states and 11544 transitions. [2021-08-29 22:13:43,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:43,590 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2021-08-29 22:13:43,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:43,644 INFO L225 Difference]: With dead ends: 3082 [2021-08-29 22:13:43,644 INFO L226 Difference]: Without dead ends: 2722 [2021-08-29 22:13:43,644 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 18.61ms TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:43,645 INFO L928 BasicCegarLoop]: 19 mSDtfsCounter, 37 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 58.96ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.65ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 69.60ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:43,645 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 65 Invalid, 87 Unknown, 0 Unchecked, 0.65ms Time], IncrementalHoareTripleChecker [6 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 69.60ms Time] [2021-08-29 22:13:43,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2722 states. [2021-08-29 22:13:43,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2722 to 2722. [2021-08-29 22:13:43,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2722 states, 2721 states have (on average 3.8302094818081587) internal successors, (10422), 2721 states have internal predecessors, (10422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 10422 transitions. [2021-08-29 22:13:43,727 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 10422 transitions. Word has length 15 [2021-08-29 22:13:43,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:43,728 INFO L470 AbstractCegarLoop]: Abstraction has 2722 states and 10422 transitions. [2021-08-29 22:13:43,728 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:43,728 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 10422 transitions. [2021-08-29 22:13:43,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:13:43,731 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:43,731 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:43,731 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-29 22:13:43,731 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:43,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:43,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1986096926, now seen corresponding path program 1 times [2021-08-29 22:13:43,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:43,732 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296900889] [2021-08-29 22:13:43,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:43,733 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:43,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:43,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:43,825 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:43,825 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296900889] [2021-08-29 22:13:43,825 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296900889] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:43,825 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:43,825 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:43,825 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900817201] [2021-08-29 22:13:43,826 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:43,826 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:43,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:43,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:43,826 INFO L87 Difference]: Start difference. First operand 2722 states and 10422 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-29 22:13:43,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:43,944 INFO L93 Difference]: Finished difference Result 2866 states and 10782 transitions. [2021-08-29 22:13:43,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:43,945 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-29 22:13:43,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:43,954 INFO L225 Difference]: With dead ends: 2866 [2021-08-29 22:13:43,954 INFO L226 Difference]: Without dead ends: 2626 [2021-08-29 22:13:43,954 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 24.81ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:43,955 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 49 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 68.80ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.04ms SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 81.97ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:43,955 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 76 Invalid, 111 Unknown, 0 Unchecked, 1.04ms Time], IncrementalHoareTripleChecker [13 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 81.97ms Time] [2021-08-29 22:13:43,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2626 states. [2021-08-29 22:13:44,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2626 to 2626. [2021-08-29 22:13:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2626 states, 2625 states have (on average 3.817904761904762) internal successors, (10022), 2625 states have internal predecessors, (10022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2626 states to 2626 states and 10022 transitions. [2021-08-29 22:13:44,083 INFO L78 Accepts]: Start accepts. Automaton has 2626 states and 10022 transitions. Word has length 16 [2021-08-29 22:13:44,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:44,083 INFO L470 AbstractCegarLoop]: Abstraction has 2626 states and 10022 transitions. [2021-08-29 22:13:44,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-29 22:13:44,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2626 states and 10022 transitions. [2021-08-29 22:13:44,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-08-29 22:13:44,088 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:44,088 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:44,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-29 22:13:44,088 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:44,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:44,089 INFO L82 PathProgramCache]: Analyzing trace with hash 527330533, now seen corresponding path program 1 times [2021-08-29 22:13:44,089 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:44,089 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313741588] [2021-08-29 22:13:44,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:44,089 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:44,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:44,242 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:44,243 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313741588] [2021-08-29 22:13:44,243 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313741588] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:44,243 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:44,243 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:44,243 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1522239922] [2021-08-29 22:13:44,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:44,244 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:44,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:44,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:44,245 INFO L87 Difference]: Start difference. First operand 2626 states and 10022 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-29 22:13:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:44,340 INFO L93 Difference]: Finished difference Result 2986 states and 11162 transitions. [2021-08-29 22:13:44,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:44,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-29 22:13:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:44,408 INFO L225 Difference]: With dead ends: 2986 [2021-08-29 22:13:44,408 INFO L226 Difference]: Without dead ends: 2674 [2021-08-29 22:13:44,408 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 26.29ms TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:44,410 INFO L928 BasicCegarLoop]: 26 mSDtfsCounter, 54 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 59.14ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.56ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 70.79ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:44,410 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 82 Invalid, 107 Unknown, 0 Unchecked, 0.56ms Time], IncrementalHoareTripleChecker [8 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 70.79ms Time] [2021-08-29 22:13:44,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2674 states. [2021-08-29 22:13:44,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2674 to 2674. [2021-08-29 22:13:44,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2674 states, 2673 states have (on average 3.8062102506546953) internal successors, (10174), 2673 states have internal predecessors, (10174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2674 states to 2674 states and 10174 transitions. [2021-08-29 22:13:44,466 INFO L78 Accepts]: Start accepts. Automaton has 2674 states and 10174 transitions. Word has length 16 [2021-08-29 22:13:44,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:44,467 INFO L470 AbstractCegarLoop]: Abstraction has 2674 states and 10174 transitions. [2021-08-29 22:13:44,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 5 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-29 22:13:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 2674 states and 10174 transitions. [2021-08-29 22:13:44,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:44,471 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:44,471 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:44,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-29 22:13:44,472 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:44,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:44,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1439452080, now seen corresponding path program 1 times [2021-08-29 22:13:44,472 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:44,472 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901914405] [2021-08-29 22:13:44,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:44,473 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:44,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:44,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:44,622 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:44,622 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901914405] [2021-08-29 22:13:44,622 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901914405] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:44,622 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:44,622 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:44,622 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963630493] [2021-08-29 22:13:44,622 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:44,623 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:44,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:44,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:44,623 INFO L87 Difference]: Start difference. First operand 2674 states and 10174 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:44,800 INFO L93 Difference]: Finished difference Result 3050 states and 11532 transitions. [2021-08-29 22:13:44,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:44,800 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:44,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:44,809 INFO L225 Difference]: With dead ends: 3050 [2021-08-29 22:13:44,828 INFO L226 Difference]: Without dead ends: 2858 [2021-08-29 22:13:44,829 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 23.87ms TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:44,829 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 48 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 134.88ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.05ms SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 155.78ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:44,830 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 147 Invalid, 203 Unknown, 0 Unchecked, 1.05ms Time], IncrementalHoareTripleChecker [6 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 155.78ms Time] [2021-08-29 22:13:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2021-08-29 22:13:44,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2746. [2021-08-29 22:13:44,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2746 states, 2745 states have (on average 3.80327868852459) internal successors, (10440), 2745 states have internal predecessors, (10440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2746 states to 2746 states and 10440 transitions. [2021-08-29 22:13:44,927 INFO L78 Accepts]: Start accepts. Automaton has 2746 states and 10440 transitions. Word has length 17 [2021-08-29 22:13:44,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:44,928 INFO L470 AbstractCegarLoop]: Abstraction has 2746 states and 10440 transitions. [2021-08-29 22:13:44,928 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:44,928 INFO L276 IsEmpty]: Start isEmpty. Operand 2746 states and 10440 transitions. [2021-08-29 22:13:44,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:44,932 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:44,932 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:44,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-29 22:13:44,932 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:44,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:44,933 INFO L82 PathProgramCache]: Analyzing trace with hash 1738660604, now seen corresponding path program 2 times [2021-08-29 22:13:44,933 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:44,933 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845240974] [2021-08-29 22:13:44,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:44,933 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:44,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:45,043 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:45,043 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845240974] [2021-08-29 22:13:45,043 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845240974] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:45,043 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:45,043 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:45,043 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231747801] [2021-08-29 22:13:45,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:45,044 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:45,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:45,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:45,044 INFO L87 Difference]: Start difference. First operand 2746 states and 10440 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:45,192 INFO L93 Difference]: Finished difference Result 3186 states and 12014 transitions. [2021-08-29 22:13:45,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:45,193 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:45,203 INFO L225 Difference]: With dead ends: 3186 [2021-08-29 22:13:45,203 INFO L226 Difference]: Without dead ends: 2978 [2021-08-29 22:13:45,204 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 40.72ms TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:45,204 INFO L928 BasicCegarLoop]: 32 mSDtfsCounter, 57 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 99.95ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.74ms SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 117.71ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:45,204 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 113 Invalid, 154 Unknown, 0 Unchecked, 0.74ms Time], IncrementalHoareTripleChecker [11 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 117.71ms Time] [2021-08-29 22:13:45,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2978 states. [2021-08-29 22:13:45,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2978 to 2858. [2021-08-29 22:13:45,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2858 states, 2857 states have (on average 3.8291914595729786) internal successors, (10940), 2857 states have internal predecessors, (10940), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2858 states to 2858 states and 10940 transitions. [2021-08-29 22:13:45,275 INFO L78 Accepts]: Start accepts. Automaton has 2858 states and 10940 transitions. Word has length 17 [2021-08-29 22:13:45,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:45,276 INFO L470 AbstractCegarLoop]: Abstraction has 2858 states and 10940 transitions. [2021-08-29 22:13:45,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,276 INFO L276 IsEmpty]: Start isEmpty. Operand 2858 states and 10940 transitions. [2021-08-29 22:13:45,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:45,280 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:45,280 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:45,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-29 22:13:45,280 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:45,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:45,281 INFO L82 PathProgramCache]: Analyzing trace with hash -832670622, now seen corresponding path program 3 times [2021-08-29 22:13:45,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:45,281 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671523386] [2021-08-29 22:13:45,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:45,281 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:45,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:45,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:45,375 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:45,375 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671523386] [2021-08-29 22:13:45,375 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671523386] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:45,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:45,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:45,376 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753300244] [2021-08-29 22:13:45,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:45,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:45,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:45,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:45,377 INFO L87 Difference]: Start difference. First operand 2858 states and 10940 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:45,564 INFO L93 Difference]: Finished difference Result 3386 states and 12808 transitions. [2021-08-29 22:13:45,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:45,564 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:45,574 INFO L225 Difference]: With dead ends: 3386 [2021-08-29 22:13:45,588 INFO L226 Difference]: Without dead ends: 3194 [2021-08-29 22:13:45,589 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 33.25ms TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:45,589 INFO L928 BasicCegarLoop]: 34 mSDtfsCounter, 72 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 140.64ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.73ms SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 155.21ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:45,590 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 109 Invalid, 137 Unknown, 0 Unchecked, 0.73ms Time], IncrementalHoareTripleChecker [5 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 155.21ms Time] [2021-08-29 22:13:45,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3194 states. [2021-08-29 22:13:45,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3194 to 2906. [2021-08-29 22:13:45,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2906 states, 2905 states have (on average 3.816867469879518) internal successors, (11088), 2905 states have internal predecessors, (11088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2906 states to 2906 states and 11088 transitions. [2021-08-29 22:13:45,715 INFO L78 Accepts]: Start accepts. Automaton has 2906 states and 11088 transitions. Word has length 17 [2021-08-29 22:13:45,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:45,715 INFO L470 AbstractCegarLoop]: Abstraction has 2906 states and 11088 transitions. [2021-08-29 22:13:45,715 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,715 INFO L276 IsEmpty]: Start isEmpty. Operand 2906 states and 11088 transitions. [2021-08-29 22:13:45,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-08-29 22:13:45,719 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:45,719 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:45,719 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-29 22:13:45,720 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:45,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:45,720 INFO L82 PathProgramCache]: Analyzing trace with hash -144286800, now seen corresponding path program 4 times [2021-08-29 22:13:45,720 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:45,720 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972578247] [2021-08-29 22:13:45,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:45,720 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:45,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:45,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:45,831 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:45,832 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972578247] [2021-08-29 22:13:45,832 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972578247] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:45,832 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:45,832 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:45,832 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850446934] [2021-08-29 22:13:45,832 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:45,832 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:45,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:45,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:45,832 INFO L87 Difference]: Start difference. First operand 2906 states and 11088 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:45,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:45,958 INFO L93 Difference]: Finished difference Result 3802 states and 14272 transitions. [2021-08-29 22:13:45,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:13:45,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2021-08-29 22:13:45,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:45,969 INFO L225 Difference]: With dead ends: 3802 [2021-08-29 22:13:45,970 INFO L226 Difference]: Without dead ends: 3498 [2021-08-29 22:13:45,970 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 31.51ms TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:13:45,970 INFO L928 BasicCegarLoop]: 28 mSDtfsCounter, 82 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 76.31ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.60ms SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 86.78ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:45,971 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 89 Invalid, 130 Unknown, 0 Unchecked, 0.60ms Time], IncrementalHoareTripleChecker [22 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 86.78ms Time] [2021-08-29 22:13:45,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3498 states. [2021-08-29 22:13:46,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3498 to 3170. [2021-08-29 22:13:46,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3169 states have (on average 3.782265698958662) internal successors, (11986), 3169 states have internal predecessors, (11986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 11986 transitions. [2021-08-29 22:13:46,032 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 11986 transitions. Word has length 17 [2021-08-29 22:13:46,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:46,032 INFO L470 AbstractCegarLoop]: Abstraction has 3170 states and 11986 transitions. [2021-08-29 22:13:46,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,033 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 11986 transitions. [2021-08-29 22:13:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:46,037 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:46,037 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:46,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-29 22:13:46,038 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1673294520, now seen corresponding path program 1 times [2021-08-29 22:13:46,038 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:46,038 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21723525] [2021-08-29 22:13:46,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:46,039 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:46,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:46,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:46,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21723525] [2021-08-29 22:13:46,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21723525] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:46,186 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:46,186 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:13:46,186 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051638330] [2021-08-29 22:13:46,186 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:13:46,186 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:46,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:13:46,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:46,187 INFO L87 Difference]: Start difference. First operand 3170 states and 11986 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:46,329 INFO L93 Difference]: Finished difference Result 4010 states and 15052 transitions. [2021-08-29 22:13:46,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:46,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:46,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:46,342 INFO L225 Difference]: With dead ends: 4010 [2021-08-29 22:13:46,343 INFO L226 Difference]: Without dead ends: 3882 [2021-08-29 22:13:46,343 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 38.67ms TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:46,344 INFO L928 BasicCegarLoop]: 32 mSDtfsCounter, 62 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.09ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.02ms SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 114.11ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:46,344 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 137 Invalid, 180 Unknown, 0 Unchecked, 1.02ms Time], IncrementalHoareTripleChecker [9 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 114.11ms Time] [2021-08-29 22:13:46,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3882 states. [2021-08-29 22:13:46,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3882 to 3242. [2021-08-29 22:13:46,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3242 states, 3241 states have (on average 3.7803147176797283) internal successors, (12252), 3241 states have internal predecessors, (12252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3242 states to 3242 states and 12252 transitions. [2021-08-29 22:13:46,433 INFO L78 Accepts]: Start accepts. Automaton has 3242 states and 12252 transitions. Word has length 18 [2021-08-29 22:13:46,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:46,434 INFO L470 AbstractCegarLoop]: Abstraction has 3242 states and 12252 transitions. [2021-08-29 22:13:46,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 3242 states and 12252 transitions. [2021-08-29 22:13:46,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:46,439 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:46,439 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:46,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-29 22:13:46,440 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:46,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:46,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1936143124, now seen corresponding path program 2 times [2021-08-29 22:13:46,440 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:46,440 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535333913] [2021-08-29 22:13:46,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:46,441 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:46,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:46,582 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:46,582 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535333913] [2021-08-29 22:13:46,582 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535333913] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:46,583 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:46,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-29 22:13:46,583 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588529369] [2021-08-29 22:13:46,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-29 22:13:46,583 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:46,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-29 22:13:46,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-08-29 22:13:46,584 INFO L87 Difference]: Start difference. First operand 3242 states and 12252 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:46,783 INFO L93 Difference]: Finished difference Result 3506 states and 13086 transitions. [2021-08-29 22:13:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-08-29 22:13:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:46,794 INFO L225 Difference]: With dead ends: 3506 [2021-08-29 22:13:46,795 INFO L226 Difference]: Without dead ends: 3346 [2021-08-29 22:13:46,795 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 91.68ms TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2021-08-29 22:13:46,795 INFO L928 BasicCegarLoop]: 33 mSDtfsCounter, 92 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 95.32ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 1.08ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 111.84ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:46,796 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 117 Invalid, 159 Unknown, 0 Unchecked, 1.08ms Time], IncrementalHoareTripleChecker [25 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 111.84ms Time] [2021-08-29 22:13:46,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3346 states. [2021-08-29 22:13:46,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3346 to 2930. [2021-08-29 22:13:46,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2930 states, 2929 states have (on average 3.7712529873677023) internal successors, (11046), 2929 states have internal predecessors, (11046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2930 states to 2930 states and 11046 transitions. [2021-08-29 22:13:46,845 INFO L78 Accepts]: Start accepts. Automaton has 2930 states and 11046 transitions. Word has length 18 [2021-08-29 22:13:46,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:46,846 INFO L470 AbstractCegarLoop]: Abstraction has 2930 states and 11046 transitions. [2021-08-29 22:13:46,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:46,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2930 states and 11046 transitions. [2021-08-29 22:13:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:46,850 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:46,850 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:46,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-29 22:13:46,850 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:46,851 INFO L82 PathProgramCache]: Analyzing trace with hash -63096264, now seen corresponding path program 1 times [2021-08-29 22:13:46,851 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:46,851 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912101928] [2021-08-29 22:13:46,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:46,851 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:46,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:46,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:46,977 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:46,977 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912101928] [2021-08-29 22:13:46,977 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912101928] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:46,977 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:46,978 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:46,978 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737307700] [2021-08-29 22:13:46,978 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-29 22:13:46,978 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-29 22:13:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:46,979 INFO L87 Difference]: Start difference. First operand 2930 states and 11046 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,099 INFO L93 Difference]: Finished difference Result 3026 states and 11266 transitions. [2021-08-29 22:13:47,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:47,099 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,107 INFO L225 Difference]: With dead ends: 3026 [2021-08-29 22:13:47,107 INFO L226 Difference]: Without dead ends: 2882 [2021-08-29 22:13:47,107 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 63.57ms TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2021-08-29 22:13:47,108 INFO L928 BasicCegarLoop]: 19 mSDtfsCounter, 66 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 64.78ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.57ms SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 75.86ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,108 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 84 Invalid, 103 Unknown, 0 Unchecked, 0.57ms Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 75.86ms Time] [2021-08-29 22:13:47,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2882 states. [2021-08-29 22:13:47,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2882 to 2882. [2021-08-29 22:13:47,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2882 states, 2881 states have (on average 3.7646650468587297) internal successors, (10846), 2881 states have internal predecessors, (10846), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2882 states to 2882 states and 10846 transitions. [2021-08-29 22:13:47,154 INFO L78 Accepts]: Start accepts. Automaton has 2882 states and 10846 transitions. Word has length 18 [2021-08-29 22:13:47,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,154 INFO L470 AbstractCegarLoop]: Abstraction has 2882 states and 10846 transitions. [2021-08-29 22:13:47,154 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 2882 states and 10846 transitions. [2021-08-29 22:13:47,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:47,158 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,159 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,159 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-08-29 22:13:47,159 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,159 INFO L82 PathProgramCache]: Analyzing trace with hash -42786490, now seen corresponding path program 1 times [2021-08-29 22:13:47,159 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,160 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274802125] [2021-08-29 22:13:47,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,160 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,190 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274802125] [2021-08-29 22:13:47,190 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274802125] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,190 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,190 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:47,190 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137029439] [2021-08-29 22:13:47,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:47,190 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:47,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:47,191 INFO L87 Difference]: Start difference. First operand 2882 states and 10846 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,260 INFO L93 Difference]: Finished difference Result 4238 states and 15779 transitions. [2021-08-29 22:13:47,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:13:47,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:47,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,267 INFO L225 Difference]: With dead ends: 4238 [2021-08-29 22:13:47,267 INFO L226 Difference]: Without dead ends: 2666 [2021-08-29 22:13:47,267 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.30ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:47,268 INFO L928 BasicCegarLoop]: 29 mSDtfsCounter, 30 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.71ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.29ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.71ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,268 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 62 Invalid, 68 Unknown, 0 Unchecked, 0.29ms Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 47.71ms Time] [2021-08-29 22:13:47,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2666 states. [2021-08-29 22:13:47,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2666 to 2522. [2021-08-29 22:13:47,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2522 states, 2521 states have (on average 3.6191987306624354) internal successors, (9124), 2521 states have internal predecessors, (9124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2522 states to 2522 states and 9124 transitions. [2021-08-29 22:13:47,309 INFO L78 Accepts]: Start accepts. Automaton has 2522 states and 9124 transitions. Word has length 18 [2021-08-29 22:13:47,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,309 INFO L470 AbstractCegarLoop]: Abstraction has 2522 states and 9124 transitions. [2021-08-29 22:13:47,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,309 INFO L276 IsEmpty]: Start isEmpty. Operand 2522 states and 9124 transitions. [2021-08-29 22:13:47,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-08-29 22:13:47,313 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,313 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-08-29 22:13:47,313 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,313 INFO L82 PathProgramCache]: Analyzing trace with hash -94503770, now seen corresponding path program 2 times [2021-08-29 22:13:47,314 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,314 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362890069] [2021-08-29 22:13:47,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,314 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,343 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,343 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362890069] [2021-08-29 22:13:47,344 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362890069] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,344 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,344 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-29 22:13:47,344 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704664249] [2021-08-29 22:13:47,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-29 22:13:47,344 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-29 22:13:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:47,345 INFO L87 Difference]: Start difference. First operand 2522 states and 9124 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,378 INFO L93 Difference]: Finished difference Result 1940 states and 6340 transitions. [2021-08-29 22:13:47,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-29 22:13:47,378 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2021-08-29 22:13:47,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,382 INFO L225 Difference]: With dead ends: 1940 [2021-08-29 22:13:47,382 INFO L226 Difference]: Without dead ends: 1940 [2021-08-29 22:13:47,382 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.15ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-29 22:13:47,382 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 11 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.90ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.14ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 25.36ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,383 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 20 Invalid, 34 Unknown, 0 Unchecked, 0.14ms Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 25.36ms Time] [2021-08-29 22:13:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1940 states. [2021-08-29 22:13:47,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1940 to 1940. [2021-08-29 22:13:47,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1939 states have (on average 3.2697266632284685) internal successors, (6340), 1939 states have internal predecessors, (6340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 6340 transitions. [2021-08-29 22:13:47,410 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 6340 transitions. Word has length 18 [2021-08-29 22:13:47,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,410 INFO L470 AbstractCegarLoop]: Abstraction has 1940 states and 6340 transitions. [2021-08-29 22:13:47,410 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 2 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 6340 transitions. [2021-08-29 22:13:47,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-08-29 22:13:47,413 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,413 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-08-29 22:13:47,413 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1647054081, now seen corresponding path program 1 times [2021-08-29 22:13:47,414 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,414 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697376619] [2021-08-29 22:13:47,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,414 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,444 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,444 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697376619] [2021-08-29 22:13:47,444 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697376619] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,444 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,444 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:47,445 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44578839] [2021-08-29 22:13:47,445 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:47,445 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:47,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:47,445 INFO L87 Difference]: Start difference. First operand 1940 states and 6340 transitions. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,491 INFO L93 Difference]: Finished difference Result 1254 states and 3698 transitions. [2021-08-29 22:13:47,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-08-29 22:13:47,492 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2021-08-29 22:13:47,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,494 INFO L225 Difference]: With dead ends: 1254 [2021-08-29 22:13:47,494 INFO L226 Difference]: Without dead ends: 1254 [2021-08-29 22:13:47,494 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.74ms TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:47,495 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 33.28ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.22ms SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.66ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,495 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 26 Invalid, 52 Unknown, 0 Unchecked, 0.22ms Time], IncrementalHoareTripleChecker [4 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 40.66ms Time] [2021-08-29 22:13:47,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1254 states. [2021-08-29 22:13:47,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1254 to 1254. [2021-08-29 22:13:47,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1254 states, 1253 states have (on average 2.951316839584996) internal successors, (3698), 1253 states have internal predecessors, (3698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 3698 transitions. [2021-08-29 22:13:47,511 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 3698 transitions. Word has length 19 [2021-08-29 22:13:47,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,512 INFO L470 AbstractCegarLoop]: Abstraction has 1254 states and 3698 transitions. [2021-08-29 22:13:47,512 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,512 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 3698 transitions. [2021-08-29 22:13:47,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2021-08-29 22:13:47,514 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,514 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,514 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-08-29 22:13:47,514 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,514 INFO L82 PathProgramCache]: Analyzing trace with hash -1736390888, now seen corresponding path program 1 times [2021-08-29 22:13:47,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,515 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320942625] [2021-08-29 22:13:47,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,515 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,542 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,542 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320942625] [2021-08-29 22:13:47,543 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320942625] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,543 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,543 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-08-29 22:13:47,543 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061617777] [2021-08-29 22:13:47,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-08-29 22:13:47,543 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-08-29 22:13:47,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-08-29 22:13:47,544 INFO L87 Difference]: Start difference. First operand 1254 states and 3698 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,618 INFO L93 Difference]: Finished difference Result 1867 states and 5308 transitions. [2021-08-29 22:13:47,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:47,618 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2021-08-29 22:13:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,620 INFO L225 Difference]: With dead ends: 1867 [2021-08-29 22:13:47,620 INFO L226 Difference]: Without dead ends: 1282 [2021-08-29 22:13:47,620 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.43ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:47,621 INFO L928 BasicCegarLoop]: 31 mSDtfsCounter, 25 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 53.74ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.34ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 63.48ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,621 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 70 Invalid, 81 Unknown, 0 Unchecked, 0.34ms Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 63.48ms Time] [2021-08-29 22:13:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1282 states. [2021-08-29 22:13:47,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1282 to 1210. [2021-08-29 22:13:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 1209 states have (on average 2.7841191066997517) internal successors, (3366), 1209 states have internal predecessors, (3366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 3366 transitions. [2021-08-29 22:13:47,636 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 3366 transitions. Word has length 21 [2021-08-29 22:13:47,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,636 INFO L470 AbstractCegarLoop]: Abstraction has 1210 states and 3366 transitions. [2021-08-29 22:13:47,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 3366 transitions. [2021-08-29 22:13:47,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-08-29 22:13:47,638 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,638 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,638 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-08-29 22:13:47,638 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,639 INFO L82 PathProgramCache]: Analyzing trace with hash -1335495724, now seen corresponding path program 1 times [2021-08-29 22:13:47,639 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,639 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14638314] [2021-08-29 22:13:47,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,639 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,674 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14638314] [2021-08-29 22:13:47,674 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14638314] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,674 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,674 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:47,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719224437] [2021-08-29 22:13:47,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:47,675 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:47,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:47,675 INFO L87 Difference]: Start difference. First operand 1210 states and 3366 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,737 INFO L93 Difference]: Finished difference Result 918 states and 2540 transitions. [2021-08-29 22:13:47,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 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 22 [2021-08-29 22:13:47,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,739 INFO L225 Difference]: With dead ends: 918 [2021-08-29 22:13:47,739 INFO L226 Difference]: Without dead ends: 854 [2021-08-29 22:13:47,739 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.17ms TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:47,740 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 68 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.70ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.38ms SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.17ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,740 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 32 Invalid, 71 Unknown, 0 Unchecked, 0.38ms Time], IncrementalHoareTripleChecker [8 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 57.17ms Time] [2021-08-29 22:13:47,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 854 states. [2021-08-29 22:13:47,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 854 to 814. [2021-08-29 22:13:47,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 813 states have (on average 2.7601476014760147) internal successors, (2244), 813 states have internal predecessors, (2244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 2244 transitions. [2021-08-29 22:13:47,751 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 2244 transitions. Word has length 22 [2021-08-29 22:13:47,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,751 INFO L470 AbstractCegarLoop]: Abstraction has 814 states and 2244 transitions. [2021-08-29 22:13:47,751 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,751 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 2244 transitions. [2021-08-29 22:13:47,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:47,752 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,753 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,753 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-08-29 22:13:47,753 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1076223676, now seen corresponding path program 1 times [2021-08-29 22:13:47,753 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,753 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796444230] [2021-08-29 22:13:47,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,754 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,785 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,785 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796444230] [2021-08-29 22:13:47,785 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796444230] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,786 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,786 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-08-29 22:13:47,786 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605817458] [2021-08-29 22:13:47,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-08-29 22:13:47,786 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-08-29 22:13:47,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-08-29 22:13:47,787 INFO L87 Difference]: Start difference. First operand 814 states and 2244 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,858 INFO L93 Difference]: Finished difference Result 1044 states and 2769 transitions. [2021-08-29 22:13:47,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-08-29 22:13:47,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:47,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,859 INFO L225 Difference]: With dead ends: 1044 [2021-08-29 22:13:47,859 INFO L226 Difference]: Without dead ends: 684 [2021-08-29 22:13:47,859 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 12.47ms TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2021-08-29 22:13:47,860 INFO L928 BasicCegarLoop]: 34 mSDtfsCounter, 36 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 48.53ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.39ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 58.76ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,860 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 96 Invalid, 103 Unknown, 0 Unchecked, 0.39ms Time], IncrementalHoareTripleChecker [0 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 58.76ms Time] [2021-08-29 22:13:47,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2021-08-29 22:13:47,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 678. [2021-08-29 22:13:47,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 677 states have (on average 2.553914327917282) internal successors, (1729), 677 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 1729 transitions. [2021-08-29 22:13:47,868 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 1729 transitions. Word has length 25 [2021-08-29 22:13:47,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,868 INFO L470 AbstractCegarLoop]: Abstraction has 678 states and 1729 transitions. [2021-08-29 22:13:47,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,868 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 1729 transitions. [2021-08-29 22:13:47,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-08-29 22:13:47,869 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,869 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,870 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-08-29 22:13:47,870 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,870 INFO L82 PathProgramCache]: Analyzing trace with hash 1635143422, now seen corresponding path program 1 times [2021-08-29 22:13:47,870 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,870 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363756445] [2021-08-29 22:13:47,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,870 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:47,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:47,911 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:47,911 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363756445] [2021-08-29 22:13:47,911 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363756445] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:47,911 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:47,911 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-08-29 22:13:47,911 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043506401] [2021-08-29 22:13:47,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-29 22:13:47,912 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:47,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-29 22:13:47,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:47,912 INFO L87 Difference]: Start difference. First operand 678 states and 1729 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:47,974 INFO L93 Difference]: Finished difference Result 622 states and 1623 transitions. [2021-08-29 22:13:47,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-08-29 22:13:47,974 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 25 [2021-08-29 22:13:47,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:47,975 INFO L225 Difference]: With dead ends: 622 [2021-08-29 22:13:47,975 INFO L226 Difference]: Without dead ends: 147 [2021-08-29 22:13:47,975 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.58ms TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2021-08-29 22:13:47,975 INFO L928 BasicCegarLoop]: 11 mSDtfsCounter, 82 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 47.29ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.32ms SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 57.60ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:47,976 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 32 Invalid, 79 Unknown, 0 Unchecked, 0.32ms Time], IncrementalHoareTripleChecker [15 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 57.60ms Time] [2021-08-29 22:13:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2021-08-29 22:13:47,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 139. [2021-08-29 22:13:47,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 2.347826086956522) internal successors, (324), 138 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 324 transitions. [2021-08-29 22:13:47,978 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 324 transitions. Word has length 25 [2021-08-29 22:13:47,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:47,978 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 324 transitions. [2021-08-29 22:13:47,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 324 transitions. [2021-08-29 22:13:47,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 22:13:47,979 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:47,979 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:47,979 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2021-08-29 22:13:47,979 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 348630712, now seen corresponding path program 1 times [2021-08-29 22:13:47,980 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:47,980 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152670458] [2021-08-29 22:13:47,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:47,980 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:47,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-29 22:13:48,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-08-29 22:13:48,185 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-29 22:13:48,185 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152670458] [2021-08-29 22:13:48,185 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152670458] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-29 22:13:48,185 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-29 22:13:48,185 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-29 22:13:48,185 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959827094] [2021-08-29 22:13:48,185 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-29 22:13:48,185 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-29 22:13:48,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-29 22:13:48,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-29 22:13:48,186 INFO L87 Difference]: Start difference. First operand 139 states and 324 transitions. Second operand has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-29 22:13:48,359 INFO L93 Difference]: Finished difference Result 203 states and 465 transitions. [2021-08-29 22:13:48,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-08-29 22:13:48,360 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2021-08-29 22:13:48,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-29 22:13:48,360 INFO L225 Difference]: With dead ends: 203 [2021-08-29 22:13:48,360 INFO L226 Difference]: Without dead ends: 93 [2021-08-29 22:13:48,360 INFO L927 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 151.02ms TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2021-08-29 22:13:48,361 INFO L928 BasicCegarLoop]: 25 mSDtfsCounter, 67 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 86.41ms Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.79ms SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 100.55ms IncrementalHoareTripleChecker+Time [2021-08-29 22:13:48,361 INFO L929 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 130 Invalid, 157 Unknown, 0 Unchecked, 0.79ms Time], IncrementalHoareTripleChecker [25 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 100.55ms Time] [2021-08-29 22:13:48,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2021-08-29 22:13:48,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2021-08-29 22:13:48,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 2.130434782608696) internal successors, (196), 92 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 196 transitions. [2021-08-29 22:13:48,362 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 196 transitions. Word has length 28 [2021-08-29 22:13:48,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-29 22:13:48,362 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 196 transitions. [2021-08-29 22:13:48,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-08-29 22:13:48,362 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 196 transitions. [2021-08-29 22:13:48,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-08-29 22:13:48,363 INFO L505 BasicCegarLoop]: Found error trace [2021-08-29 22:13:48,363 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-29 22:13:48,363 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2021-08-29 22:13:48,363 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 4 more)] === [2021-08-29 22:13:48,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-29 22:13:48,363 INFO L82 PathProgramCache]: Analyzing trace with hash 216556974, now seen corresponding path program 2 times [2021-08-29 22:13:48,363 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-29 22:13:48,363 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658166620] [2021-08-29 22:13:48,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-29 22:13:48,363 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-29 22:13:48,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:13:48,387 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-29 22:13:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-29 22:13:48,439 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-29 22:13:48,439 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-08-29 22:13:48,440 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 7 remaining) [2021-08-29 22:13:48,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (5 of 7 remaining) [2021-08-29 22:13:48,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION (4 of 7 remaining) [2021-08-29 22:13:48,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION (3 of 7 remaining) [2021-08-29 22:13:48,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION (2 of 7 remaining) [2021-08-29 22:13:48,441 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATION (1 of 7 remaining) [2021-08-29 22:13:48,442 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 7 remaining) [2021-08-29 22:13:48,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2021-08-29 22:13:48,446 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-29 22:13:48,446 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-29 22:13:48,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 10:13:48 BasicIcfg [2021-08-29 22:13:48,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-29 22:13:48,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-08-29 22:13:48,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-08-29 22:13:48,530 INFO L275 PluginConnector]: Witness Printer initialized [2021-08-29 22:13:48,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 10:13:35" (3/4) ... [2021-08-29 22:13:48,531 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-08-29 22:13:48,609 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-08-29 22:13:48,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-08-29 22:13:48,610 INFO L158 Benchmark]: Toolchain (without parser) took 14321.45ms. Allocated memory was 75.5MB in the beginning and 606.1MB in the end (delta: 530.6MB). Free memory was 57.9MB in the beginning and 263.5MB in the end (delta: -205.6MB). Peak memory consumption was 323.1MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,610 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 75.5MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2021-08-29 22:13:48,613 INFO L158 Benchmark]: CACSL2BoogieTranslator took 380.62ms. Allocated memory is still 75.5MB. Free memory was 57.7MB in the beginning and 45.6MB in the end (delta: 12.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,613 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.59ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 42.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,613 INFO L158 Benchmark]: Boogie Preprocessor took 23.24ms. Allocated memory is still 75.5MB. Free memory was 42.5MB in the beginning and 40.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,613 INFO L158 Benchmark]: RCFGBuilder took 542.73ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 40.1MB in the beginning and 59.7MB in the end (delta: -19.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,614 INFO L158 Benchmark]: TraceAbstraction took 13255.65ms. Allocated memory was 111.1MB in the beginning and 606.1MB in the end (delta: 494.9MB). Free memory was 59.1MB in the beginning and 283.4MB in the end (delta: -224.3MB). Peak memory consumption was 270.7MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,614 INFO L158 Benchmark]: Witness Printer took 79.70ms. Allocated memory is still 606.1MB. Free memory was 283.4MB in the beginning and 263.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2021-08-29 22:13:48,618 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.10ms. Allocated memory is still 75.5MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 380.62ms. Allocated memory is still 75.5MB. Free memory was 57.7MB in the beginning and 45.6MB in the end (delta: 12.0MB). Peak memory consumption was 13.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.59ms. Allocated memory is still 75.5MB. Free memory was 45.6MB in the beginning and 42.5MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 23.24ms. Allocated memory is still 75.5MB. Free memory was 42.5MB in the beginning and 40.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 542.73ms. Allocated memory was 75.5MB in the beginning and 111.1MB in the end (delta: 35.7MB). Free memory was 40.1MB in the beginning and 59.7MB in the end (delta: -19.6MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 13255.65ms. Allocated memory was 111.1MB in the beginning and 606.1MB in the end (delta: 494.9MB). Free memory was 59.1MB in the beginning and 283.4MB in the end (delta: -224.3MB). Peak memory consumption was 270.7MB. Max. memory is 16.1GB. * Witness Printer took 79.70ms. Allocated memory is still 606.1MB. Free memory was 283.4MB in the beginning and 263.5MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6318.50ms, 138 PlacesBefore, 47 PlacesAfterwards, 127 TransitionsBefore, 35 TransitionsAfterwards, 2928 CoEnabledTransitionPairs, 7 FixpointIterations, 41 TrivialSequentialCompositions, 57 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 1 ChoiceCompositions, 105 TotalNumberOfCompositions, 7994 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 3556, positive: 3343, positive conditional: 0, positive unconditional: 3343, negative: 213, negative conditional: 0, negative unconditional: 213, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1962, positive: 1911, positive conditional: 0, positive unconditional: 1911, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1962, positive: 1875, positive conditional: 0, positive unconditional: 1875, negative: 87, negative conditional: 0, negative unconditional: 87, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 87, positive: 36, positive conditional: 0, positive unconditional: 36, negative: 51, negative conditional: 0, negative unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 338, positive: 29, positive conditional: 0, positive unconditional: 29, negative: 309, negative conditional: 0, negative unconditional: 309, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 3556, positive: 1432, positive conditional: 0, positive unconditional: 1432, negative: 162, negative conditional: 0, negative unconditional: 162, unknown: 1962, unknown conditional: 0, unknown unconditional: 1962] , Statistics on independence cache: Total cache size (in pairs): 170, Positive cache size: 144, Positive conditional cache size: 0, Positive unconditional cache size: 144, Negative cache size: 26, Negative conditional cache size: 0, Negative unconditional cache size: 26 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.00ms ErrorAutomatonConstructionTimeTotal, 0.00ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.00ms ErrorAutomatonConstructionTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeAvg, 0.00ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p3_EAX = 0; [L714] 0 int __unbuffered_p3_EBX = 0; [L716] 0 int a = 0; [L717] 0 _Bool main$tmp_guard0; [L718] 0 _Bool main$tmp_guard1; [L720] 0 int x = 0; [L722] 0 int y = 0; [L723] 0 _Bool y$flush_delayed; [L724] 0 int y$mem_tmp; [L725] 0 _Bool y$r_buff0_thd0; [L726] 0 _Bool y$r_buff0_thd1; [L727] 0 _Bool y$r_buff0_thd2; [L728] 0 _Bool y$r_buff0_thd3; [L729] 0 _Bool y$r_buff0_thd4; [L730] 0 _Bool y$r_buff1_thd0; [L731] 0 _Bool y$r_buff1_thd1; [L732] 0 _Bool y$r_buff1_thd2; [L733] 0 _Bool y$r_buff1_thd3; [L734] 0 _Bool y$r_buff1_thd4; [L735] 0 _Bool y$read_delayed; [L736] 0 int *y$read_delayed_var; [L737] 0 int y$w_buff0; [L738] 0 _Bool y$w_buff0_used; [L739] 0 int y$w_buff1; [L740] 0 _Bool y$w_buff1_used; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L844] 0 pthread_t t813; [L845] FCALL, FORK 0 pthread_create(&t813, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L846] 0 pthread_t t814; [L847] FCALL, FORK 0 pthread_create(&t814, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L848] 0 pthread_t t815; [L849] FCALL, FORK 0 pthread_create(&t815, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L850] 0 pthread_t t816; [L851] FCALL, FORK 0 pthread_create(&t816, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L783] 3 y$w_buff1 = y$w_buff0 [L784] 3 y$w_buff0 = 2 [L785] 3 y$w_buff1_used = y$w_buff0_used [L786] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L796] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L813] 4 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L816] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L748] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L751] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L763] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L766] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=2] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L800] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L801] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L802] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L802] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L803] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L803] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L806] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L808] 3 return 0; [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] EXPR 4 y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L823] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L826] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L826] 4 y$r_buff1_thd4 = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$r_buff1_thd4 [L829] 4 __unbuffered_cnt = __unbuffered_cnt + 1 [L831] 4 return 0; [L769] 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) [L769] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L769] 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) [L769] 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) [L770] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L770] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L771] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L771] 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 [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L772] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L773] 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 [L776] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L778] 2 return 0; [L756] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L758] 1 return 0; [L853] 0 main$tmp_guard0 = __unbuffered_cnt == 4 [L3] COND FALSE 0 !(!cond) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] [L857] 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) [L857] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L857] 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) [L857] 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) [L858] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L859] 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 [L860] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L861] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L861] 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 [L864] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L865] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L866] 0 y$flush_delayed = weak$$choice2 [L867] 0 y$mem_tmp = y [L868] 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) [L868] 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) [L869] 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)) [L869] EXPR 0 !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) [L869] 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)) [L869] 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)) [L870] 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)) [L870] EXPR 0 !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) [L870] 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)) [L870] 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)) [L871] 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)) [L871] EXPR 0 !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) [L871] 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)) [L871] 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)) [L872] 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)) [L872] EXPR 0 !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) [L872] 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)) [L872] 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)) [L873] 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)) [L873] EXPR 0 !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) [L873] 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)) [L873] 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)) [L874] 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)) [L874] EXPR 0 !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) [L874] 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)) [L874] 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)) [L875] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) [L876] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L876] 0 y = y$flush_delayed ? y$mem_tmp : y [L877] 0 y$flush_delayed = (_Bool)0 [L18] COND TRUE 0 !expression [L18] 0 reach_error() VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=2] - UnprovableResult [Line: 18]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 845]: 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: 847]: 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: 851]: 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: 849]: 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 9 procedures, 163 locations, 7 error locations. Started 1 CEGAR loops. OverallTime: 13072.27ms, OverallIterations: 23, TraceHistogramMax: 1, EmptinessCheckTime: 73.89ms, AutomataDifference: 2761.94ms, DeadEndRemovalTime: 0.00ms, HoareAnnotationTime: 0.00ms, InitialAbstractionConstructionTime: 6551.34ms, PartialOrderReductionTime: 0.00ms, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1109 SdHoareTripleChecker+Valid, 1691.47ms IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1109 mSDsluCounter, 1667 SdHoareTripleChecker+Invalid, 1441.22ms Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2010 mSDsCounter, 173 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2048 IncrementalHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 173 mSolverCounterUnsat, 521 mSDtfsCounter, 2048 mSolverCounterSat, 13.87ms SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 606.65ms Time, 0.00ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=4130occurred in iteration=0, InterpolantAutomatonStates: 121, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.00ms DumpTime, AutomataMinimizationStatistics: 1382.95ms AutomataMinimizationTime, 22 MinimizatonAttempts, 2174 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 51.47ms SsaConstructionTime, 386.99ms SatisfiabilityAnalysisTime, 1554.33ms InterpolantComputationTime, 419 NumberOfCodeBlocks, 419 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 369 ConstructedInterpolants, 0 QuantifiedInterpolants, 3532 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 22 InterpolantComputations, 22 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-29 22:13:48,672 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...