/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-87fd7473a0bda1db0ad7f77f2116346063730f21-87fd747 [2021-08-21 17:05:57,082 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-08-21 17:05:57,083 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-08-21 17:05:57,108 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-08-21 17:05:57,108 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-08-21 17:05:57,110 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-08-21 17:05:57,111 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-08-21 17:05:57,113 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-08-21 17:05:57,114 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-08-21 17:05:57,115 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-08-21 17:05:57,116 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-08-21 17:05:57,117 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-08-21 17:05:57,118 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-08-21 17:05:57,119 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-08-21 17:05:57,120 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-08-21 17:05:57,121 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-08-21 17:05:57,122 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-08-21 17:05:57,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-08-21 17:05:57,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-08-21 17:05:57,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-08-21 17:05:57,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-08-21 17:05:57,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-08-21 17:05:57,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-08-21 17:05:57,130 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-08-21 17:05:57,132 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-08-21 17:05:57,132 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-08-21 17:05:57,133 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-08-21 17:05:57,133 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-08-21 17:05:57,134 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-08-21 17:05:57,135 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-08-21 17:05:57,135 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-08-21 17:05:57,136 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-08-21 17:05:57,136 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-08-21 17:05:57,137 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-08-21 17:05:57,138 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-08-21 17:05:57,138 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-08-21 17:05:57,139 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-08-21 17:05:57,139 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-08-21 17:05:57,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-08-21 17:05:57,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-08-21 17:05:57,140 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-08-21 17:05:57,141 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe-Delay.epf [2021-08-21 17:05:57,168 INFO L113 SettingsManager]: Loading preferences was successful [2021-08-21 17:05:57,168 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-08-21 17:05:57,170 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-08-21 17:05:57,170 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-08-21 17:05:57,170 INFO L138 SettingsManager]: * Use SBE=true [2021-08-21 17:05:57,170 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-08-21 17:05:57,171 INFO L138 SettingsManager]: * sizeof long=4 [2021-08-21 17:05:57,171 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-08-21 17:05:57,171 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-08-21 17:05:57,171 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-08-21 17:05:57,171 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-08-21 17:05:57,172 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-08-21 17:05:57,172 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-08-21 17:05:57,172 INFO L138 SettingsManager]: * sizeof long double=12 [2021-08-21 17:05:57,172 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-08-21 17:05:57,177 INFO L138 SettingsManager]: * Use constant arrays=true [2021-08-21 17:05:57,177 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-08-21 17:05:57,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-08-21 17:05:57,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-08-21 17:05:57,177 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-08-21 17:05:57,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-08-21 17:05:57,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:05:57,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-08-21 17:05:57,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-08-21 17:05:57,178 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-08-21 17:05:57,178 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-08-21 17:05:57,179 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-08-21 17:05:57,179 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-08-21 17:05:57,179 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-08-21 17:05:57,179 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-08-21 17:05:57,180 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 [2021-08-21 17:05:57,535 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-08-21 17:05:57,554 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-08-21 17:05:57,557 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-08-21 17:05:57,558 INFO L271 PluginConnector]: Initializing CDTParser... [2021-08-21 17:05:57,561 INFO L275 PluginConnector]: CDTParser initialized [2021-08-21 17:05:57,563 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2021-08-21 17:05:57,635 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f967929/d66c1cfcf5ca4af086b6b39dda378603/FLAGf42969d01 [2021-08-21 17:05:58,214 INFO L306 CDTParser]: Found 1 translation units. [2021-08-21 17:05:58,215 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i [2021-08-21 17:05:58,233 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f967929/d66c1cfcf5ca4af086b6b39dda378603/FLAGf42969d01 [2021-08-21 17:05:58,531 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19f967929/d66c1cfcf5ca4af086b6b39dda378603 [2021-08-21 17:05:58,533 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-08-21 17:05:58,535 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-08-21 17:05:58,536 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-08-21 17:05:58,537 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-08-21 17:05:58,546 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-08-21 17:05:58,547 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:05:58" (1/1) ... [2021-08-21 17:05:58,547 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6efcf6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:58, skipping insertion in model container [2021-08-21 17:05:58,548 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.08 05:05:58" (1/1) ... [2021-08-21 17:05:58,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-08-21 17:05:58,637 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-08-21 17:05:58,825 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i[948,961] [2021-08-21 17:05:59,076 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:05:59,085 INFO L203 MainTranslator]: Completed pre-run [2021-08-21 17:05:59,097 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_tso.opt.i[948,961] [2021-08-21 17:05:59,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-08-21 17:05:59,166 INFO L208 MainTranslator]: Completed translation [2021-08-21 17:05:59,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59 WrapperNode [2021-08-21 17:05:59,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-08-21 17:05:59,168 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-08-21 17:05:59,169 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-08-21 17:05:59,169 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-08-21 17:05:59,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,189 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,231 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-08-21 17:05:59,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-08-21 17:05:59,232 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-08-21 17:05:59,232 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-08-21 17:05:59,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,256 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,257 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,286 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,290 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-08-21 17:05:59,291 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-08-21 17:05:59,291 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-08-21 17:05:59,291 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-08-21 17:05:59,309 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (1/1) ... [2021-08-21 17:05:59,315 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-08-21 17:05:59,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-08-21 17:05:59,333 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-21 17:05:59,355 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-21 17:05:59,395 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-08-21 17:05:59,396 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-08-21 17:05:59,398 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-08-21 17:05:59,398 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-08-21 17:05:59,398 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-08-21 17:05:59,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-08-21 17:05:59,398 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-08-21 17:05:59,398 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-08-21 17:05:59,398 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-08-21 17:05:59,399 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-08-21 17:05:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-08-21 17:05:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-08-21 17:05:59,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-08-21 17:05:59,399 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-08-21 17:05:59,401 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-08-21 17:06:01,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-08-21 17:06:01,213 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-08-21 17:06:01,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:06:01 BoogieIcfgContainer [2021-08-21 17:06:01,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-08-21 17:06:01,217 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-08-21 17:06:01,217 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-08-21 17:06:01,219 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-08-21 17:06:01,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.08 05:05:58" (1/3) ... [2021-08-21 17:06:01,220 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74400254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:06:01, skipping insertion in model container [2021-08-21 17:06:01,220 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.08 05:05:59" (2/3) ... [2021-08-21 17:06:01,221 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74400254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.08 05:06:01, skipping insertion in model container [2021-08-21 17:06:01,221 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.08 05:06:01" (3/3) ... [2021-08-21 17:06:01,222 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_tso.opt.i [2021-08-21 17:06:01,226 WARN L149 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-08-21 17:06:01,226 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-08-21 17:06:01,226 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-08-21 17:06:01,227 INFO L516 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-08-21 17:06:01,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,259 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,260 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,260 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,261 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,261 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,262 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,263 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,264 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,265 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,266 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,266 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,266 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,266 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,267 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,268 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,268 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,268 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,269 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,270 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,271 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,272 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,275 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,275 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,276 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,277 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,283 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,283 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,286 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,286 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,287 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,288 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-08-21 17:06:01,291 INFO L148 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-08-21 17:06:01,327 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-08-21 17:06:01,332 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-21 17:06:01,333 INFO L340 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2021-08-21 17:06:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 10392 states, 9097 states have (on average 2.069253600087941) internal successors, (18824), 10391 states have internal predecessors, (18824), 0 states have call successors, (0), 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-21 17:06:02,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-08-21 17:06:02,871 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:02,872 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:06:02,873 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting P2Err0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:02,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:02,879 INFO L82 PathProgramCache]: Analyzing trace with hash -1597922012, now seen corresponding path program 1 times [2021-08-21 17:06:02,887 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:02,888 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329606632] [2021-08-21 17:06:02,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:02,889 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:03,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:03,205 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-21 17:06:03,205 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:03,205 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329606632] [2021-08-21 17:06:03,206 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329606632] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:03,206 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:03,206 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-08-21 17:06:03,208 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350434552] [2021-08-21 17:06:03,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-08-21 17:06:03,211 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:03,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-08-21 17:06:03,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:06:03,246 INFO L87 Difference]: Start difference. First operand has 10392 states, 9097 states have (on average 2.069253600087941) internal successors, (18824), 10391 states have internal predecessors, (18824), 0 states have call successors, (0), 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 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-21 17:06:03,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:03,387 INFO L93 Difference]: Finished difference Result 8768 states and 15383 transitions. [2021-08-21 17:06:03,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-08-21 17:06:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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 55 [2021-08-21 17:06:03,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:03,428 INFO L225 Difference]: With dead ends: 8768 [2021-08-21 17:06:03,428 INFO L226 Difference]: Without dead ends: 4535 [2021-08-21 17:06:03,429 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-08-21 17:06:03,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2021-08-21 17:06:03,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4535. [2021-08-21 17:06:03,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4535 states, 4479 states have (on average 2.1701272605492297) internal successors, (9720), 4534 states have internal predecessors, (9720), 0 states have call successors, (0), 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-21 17:06:03,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4535 states to 4535 states and 9720 transitions. [2021-08-21 17:06:03,718 INFO L78 Accepts]: Start accepts. Automaton has 4535 states and 9720 transitions. Word has length 55 [2021-08-21 17:06:03,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:03,719 INFO L470 AbstractCegarLoop]: Abstraction has 4535 states and 9720 transitions. [2021-08-21 17:06:03,720 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 27.5) internal successors, (55), 3 states have internal predecessors, (55), 0 states have call successors, (0), 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-21 17:06:03,720 INFO L276 IsEmpty]: Start isEmpty. Operand 4535 states and 9720 transitions. [2021-08-21 17:06:03,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-08-21 17:06:03,732 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:03,732 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:03,732 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-08-21 17:06:03,733 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:03,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:03,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1989832496, now seen corresponding path program 1 times [2021-08-21 17:06:03,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:03,736 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332220961] [2021-08-21 17:06:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:03,737 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:03,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:03,953 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-21 17:06:03,953 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:03,953 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332220961] [2021-08-21 17:06:03,954 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332220961] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:03,954 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:03,954 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:06:03,954 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617489156] [2021-08-21 17:06:03,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:06:03,955 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:03,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:06:03,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:06:03,956 INFO L87 Difference]: Start difference. First operand 4535 states and 9720 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-21 17:06:04,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:04,115 INFO L93 Difference]: Finished difference Result 5591 states and 12528 transitions. [2021-08-21 17:06:04,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:06:04,116 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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 67 [2021-08-21 17:06:04,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:04,139 INFO L225 Difference]: With dead ends: 5591 [2021-08-21 17:06:04,139 INFO L226 Difference]: Without dead ends: 4247 [2021-08-21 17:06:04,140 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 95.4ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:06:04,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2021-08-21 17:06:04,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4247. [2021-08-21 17:06:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4247 states, 4191 states have (on average 2.187544738725841) internal successors, (9168), 4246 states have internal predecessors, (9168), 0 states have call successors, (0), 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-21 17:06:04,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4247 states to 4247 states and 9168 transitions. [2021-08-21 17:06:04,325 INFO L78 Accepts]: Start accepts. Automaton has 4247 states and 9168 transitions. Word has length 67 [2021-08-21 17:06:04,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:04,326 INFO L470 AbstractCegarLoop]: Abstraction has 4247 states and 9168 transitions. [2021-08-21 17:06:04,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 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-21 17:06:04,327 INFO L276 IsEmpty]: Start isEmpty. Operand 4247 states and 9168 transitions. [2021-08-21 17:06:04,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-08-21 17:06:04,332 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:04,332 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:04,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-08-21 17:06:04,333 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:04,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:04,333 INFO L82 PathProgramCache]: Analyzing trace with hash -358065839, now seen corresponding path program 1 times [2021-08-21 17:06:04,333 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:04,334 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850894881] [2021-08-21 17:06:04,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:04,334 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:04,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:04,688 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-21 17:06:04,689 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:04,689 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850894881] [2021-08-21 17:06:04,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850894881] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:04,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:04,690 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 17:06:04,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729612121] [2021-08-21 17:06:04,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 17:06:04,693 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:04,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 17:06:04,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2021-08-21 17:06:04,694 INFO L87 Difference]: Start difference. First operand 4247 states and 9168 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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-21 17:06:05,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:05,053 INFO L93 Difference]: Finished difference Result 5261 states and 11840 transitions. [2021-08-21 17:06:05,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 17:06:05,054 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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 69 [2021-08-21 17:06:05,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:05,076 INFO L225 Difference]: With dead ends: 5261 [2021-08-21 17:06:05,076 INFO L226 Difference]: Without dead ends: 4109 [2021-08-21 17:06:05,077 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 261.2ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:06:05,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4109 states. [2021-08-21 17:06:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4109 to 4067. [2021-08-21 17:06:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4067 states, 4011 states have (on average 2.1795063575168285) internal successors, (8742), 4066 states have internal predecessors, (8742), 0 states have call successors, (0), 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-21 17:06:05,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 8742 transitions. [2021-08-21 17:06:05,194 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 8742 transitions. Word has length 69 [2021-08-21 17:06:05,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:05,194 INFO L470 AbstractCegarLoop]: Abstraction has 4067 states and 8742 transitions. [2021-08-21 17:06:05,195 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 0 states have call successors, (0), 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-21 17:06:05,195 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 8742 transitions. [2021-08-21 17:06:05,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 17:06:05,209 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:05,210 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:05,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-08-21 17:06:05,210 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:05,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:05,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1611627816, now seen corresponding path program 1 times [2021-08-21 17:06:05,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:05,211 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511454930] [2021-08-21 17:06:05,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:05,211 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:05,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:05,490 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-21 17:06:05,490 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:05,490 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511454930] [2021-08-21 17:06:05,490 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511454930] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:05,491 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:05,491 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:06:05,491 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567305590] [2021-08-21 17:06:05,492 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:06:05,493 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:05,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:06:05,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:06:05,493 INFO L87 Difference]: Start difference. First operand 4067 states and 8742 transitions. Second operand has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-21 17:06:05,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:05,816 INFO L93 Difference]: Finished difference Result 4753 states and 10629 transitions. [2021-08-21 17:06:05,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-08-21 17:06:05,817 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-08-21 17:06:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:05,840 INFO L225 Difference]: With dead ends: 4753 [2021-08-21 17:06:05,840 INFO L226 Difference]: Without dead ends: 4081 [2021-08-21 17:06:05,841 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 158.1ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:06:05,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4081 states. [2021-08-21 17:06:05,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4081 to 4081. [2021-08-21 17:06:05,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4081 states, 4025 states have (on average 2.177142857142857) internal successors, (8763), 4080 states have internal predecessors, (8763), 0 states have call successors, (0), 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-21 17:06:05,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 8763 transitions. [2021-08-21 17:06:05,960 INFO L78 Accepts]: Start accepts. Automaton has 4081 states and 8763 transitions. Word has length 70 [2021-08-21 17:06:05,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:05,960 INFO L470 AbstractCegarLoop]: Abstraction has 4081 states and 8763 transitions. [2021-08-21 17:06:05,960 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.0) internal successors, (70), 7 states have internal predecessors, (70), 0 states have call successors, (0), 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-21 17:06:05,960 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 8763 transitions. [2021-08-21 17:06:05,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-08-21 17:06:05,966 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:05,966 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:05,966 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-08-21 17:06:05,967 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:05,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:05,967 INFO L82 PathProgramCache]: Analyzing trace with hash -1091154082, now seen corresponding path program 2 times [2021-08-21 17:06:05,967 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:05,968 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557223864] [2021-08-21 17:06:05,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:05,968 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:06,250 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-21 17:06:06,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:06,251 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557223864] [2021-08-21 17:06:06,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557223864] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:06,251 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:06,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-08-21 17:06:06,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60275460] [2021-08-21 17:06:06,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-08-21 17:06:06,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:06,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-08-21 17:06:06,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2021-08-21 17:06:06,253 INFO L87 Difference]: Start difference. First operand 4081 states and 8763 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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-21 17:06:06,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:06,807 INFO L93 Difference]: Finished difference Result 5145 states and 11694 transitions. [2021-08-21 17:06:06,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-08-21 17:06:06,808 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2021-08-21 17:06:06,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:06,829 INFO L225 Difference]: With dead ends: 5145 [2021-08-21 17:06:06,830 INFO L226 Difference]: Without dead ends: 4361 [2021-08-21 17:06:06,830 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 375.0ms TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2021-08-21 17:06:06,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4361 states. [2021-08-21 17:06:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4361 to 4109. [2021-08-21 17:06:06,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4109 states, 4053 states have (on average 2.167776955341722) internal successors, (8786), 4108 states have internal predecessors, (8786), 0 states have call successors, (0), 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-21 17:06:06,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4109 states to 4109 states and 8786 transitions. [2021-08-21 17:06:06,957 INFO L78 Accepts]: Start accepts. Automaton has 4109 states and 8786 transitions. Word has length 70 [2021-08-21 17:06:06,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:06,957 INFO L470 AbstractCegarLoop]: Abstraction has 4109 states and 8786 transitions. [2021-08-21 17:06:06,957 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 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-21 17:06:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 4109 states and 8786 transitions. [2021-08-21 17:06:06,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-21 17:06:06,964 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:06,964 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:06,964 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-08-21 17:06:06,964 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:06,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:06,965 INFO L82 PathProgramCache]: Analyzing trace with hash -603199345, now seen corresponding path program 1 times [2021-08-21 17:06:06,965 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:06,965 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361202965] [2021-08-21 17:06:06,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:06,965 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:06,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:07,208 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-21 17:06:07,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:07,209 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361202965] [2021-08-21 17:06:07,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361202965] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:07,209 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:07,209 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 17:06:07,210 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830340588] [2021-08-21 17:06:07,210 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 17:06:07,210 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:07,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 17:06:07,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:06:07,211 INFO L87 Difference]: Start difference. First operand 4109 states and 8786 transitions. Second operand has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 17:06:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:07,461 INFO L93 Difference]: Finished difference Result 4709 states and 10334 transitions. [2021-08-21 17:06:07,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-08-21 17:06:07,462 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-08-21 17:06:07,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:07,473 INFO L225 Difference]: With dead ends: 4709 [2021-08-21 17:06:07,474 INFO L226 Difference]: Without dead ends: 3845 [2021-08-21 17:06:07,474 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 204.2ms TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2021-08-21 17:06:07,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3845 states. [2021-08-21 17:06:07,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3845 to 3845. [2021-08-21 17:06:07,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3789 states have (on average 2.113486408023225) internal successors, (8008), 3844 states have internal predecessors, (8008), 0 states have call successors, (0), 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-21 17:06:07,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 8008 transitions. [2021-08-21 17:06:07,567 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 8008 transitions. Word has length 71 [2021-08-21 17:06:07,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:07,567 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 8008 transitions. [2021-08-21 17:06:07,567 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.454545454545454) internal successors, (71), 11 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 17:06:07,568 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 8008 transitions. [2021-08-21 17:06:07,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-08-21 17:06:07,573 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:07,574 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:07,574 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-08-21 17:06:07,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:07,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:07,577 INFO L82 PathProgramCache]: Analyzing trace with hash -864874638, now seen corresponding path program 1 times [2021-08-21 17:06:07,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:07,578 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974039792] [2021-08-21 17:06:07,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:07,578 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:07,790 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-21 17:06:07,790 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:07,790 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974039792] [2021-08-21 17:06:07,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974039792] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:07,790 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:07,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-08-21 17:06:07,791 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008770889] [2021-08-21 17:06:07,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-08-21 17:06:07,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:07,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-08-21 17:06:07,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-08-21 17:06:07,792 INFO L87 Difference]: Start difference. First operand 3845 states and 8008 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 17:06:08,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:08,021 INFO L93 Difference]: Finished difference Result 4111 states and 8757 transitions. [2021-08-21 17:06:08,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 17:06:08,022 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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 71 [2021-08-21 17:06:08,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:08,032 INFO L225 Difference]: With dead ends: 4111 [2021-08-21 17:06:08,032 INFO L226 Difference]: Without dead ends: 3369 [2021-08-21 17:06:08,033 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 137.7ms TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2021-08-21 17:06:08,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3369 states. [2021-08-21 17:06:08,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3369 to 3362. [2021-08-21 17:06:08,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3362 states, 3320 states have (on average 2.152710843373494) internal successors, (7147), 3361 states have internal predecessors, (7147), 0 states have call successors, (0), 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-21 17:06:08,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3362 states to 3362 states and 7147 transitions. [2021-08-21 17:06:08,118 INFO L78 Accepts]: Start accepts. Automaton has 3362 states and 7147 transitions. Word has length 71 [2021-08-21 17:06:08,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:08,118 INFO L470 AbstractCegarLoop]: Abstraction has 3362 states and 7147 transitions. [2021-08-21 17:06:08,119 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 0 states have call successors, (0), 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-21 17:06:08,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3362 states and 7147 transitions. [2021-08-21 17:06:08,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-08-21 17:06:08,126 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:08,126 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:08,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-08-21 17:06:08,127 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:08,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:08,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1442211122, now seen corresponding path program 1 times [2021-08-21 17:06:08,127 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:08,128 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611148880] [2021-08-21 17:06:08,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:08,128 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:08,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:08,220 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-21 17:06:08,221 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:08,221 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611148880] [2021-08-21 17:06:08,221 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611148880] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:08,221 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:08,221 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:06:08,221 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489789810] [2021-08-21 17:06:08,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:06:08,222 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:06:08,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:06:08,222 INFO L87 Difference]: Start difference. First operand 3362 states and 7147 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-21 17:06:08,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:08,331 INFO L93 Difference]: Finished difference Result 3956 states and 7966 transitions. [2021-08-21 17:06:08,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:06:08,332 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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 73 [2021-08-21 17:06:08,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:08,340 INFO L225 Difference]: With dead ends: 3956 [2021-08-21 17:06:08,340 INFO L226 Difference]: Without dead ends: 2720 [2021-08-21 17:06:08,341 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 74.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:06:08,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2021-08-21 17:06:08,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2720. [2021-08-21 17:06:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2720 states, 2678 states have (on average 2.1482449589245705) internal successors, (5753), 2719 states have internal predecessors, (5753), 0 states have call successors, (0), 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-21 17:06:08,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2720 states to 2720 states and 5753 transitions. [2021-08-21 17:06:08,403 INFO L78 Accepts]: Start accepts. Automaton has 2720 states and 5753 transitions. Word has length 73 [2021-08-21 17:06:08,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:08,403 INFO L470 AbstractCegarLoop]: Abstraction has 2720 states and 5753 transitions. [2021-08-21 17:06:08,403 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 6 states have internal predecessors, (73), 0 states have call successors, (0), 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-21 17:06:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 2720 states and 5753 transitions. [2021-08-21 17:06:08,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-08-21 17:06:08,408 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:08,408 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:08,409 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-08-21 17:06:08,409 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:08,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:08,409 INFO L82 PathProgramCache]: Analyzing trace with hash 1089687587, now seen corresponding path program 1 times [2021-08-21 17:06:08,409 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:08,410 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795279226] [2021-08-21 17:06:08,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:08,410 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:08,543 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-21 17:06:08,543 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:08,543 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795279226] [2021-08-21 17:06:08,544 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795279226] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:08,545 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:08,545 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-08-21 17:06:08,545 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446497251] [2021-08-21 17:06:08,545 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-08-21 17:06:08,545 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:08,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-08-21 17:06:08,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-08-21 17:06:08,546 INFO L87 Difference]: Start difference. First operand 2720 states and 5753 transitions. Second operand has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-21 17:06:08,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:08,665 INFO L93 Difference]: Finished difference Result 2268 states and 4386 transitions. [2021-08-21 17:06:08,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-08-21 17:06:08,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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 74 [2021-08-21 17:06:08,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:08,669 INFO L225 Difference]: With dead ends: 2268 [2021-08-21 17:06:08,669 INFO L226 Difference]: Without dead ends: 1356 [2021-08-21 17:06:08,670 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 83.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-08-21 17:06:08,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2021-08-21 17:06:08,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1348. [2021-08-21 17:06:08,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1348 states, 1318 states have (on average 2.0440060698027316) internal successors, (2694), 1347 states have internal predecessors, (2694), 0 states have call successors, (0), 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-21 17:06:08,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 2694 transitions. [2021-08-21 17:06:08,694 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 2694 transitions. Word has length 74 [2021-08-21 17:06:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:08,694 INFO L470 AbstractCegarLoop]: Abstraction has 1348 states and 2694 transitions. [2021-08-21 17:06:08,694 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.571428571428571) internal successors, (74), 7 states have internal predecessors, (74), 0 states have call successors, (0), 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-21 17:06:08,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 2694 transitions. [2021-08-21 17:06:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-08-21 17:06:08,696 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:08,696 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:08,697 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-08-21 17:06:08,697 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:08,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash -824390844, now seen corresponding path program 1 times [2021-08-21 17:06:08,697 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:08,697 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829106461] [2021-08-21 17:06:08,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:08,698 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:08,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:08,791 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-21 17:06:08,791 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:08,791 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829106461] [2021-08-21 17:06:08,792 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829106461] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:08,792 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:08,792 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-08-21 17:06:08,792 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363635933] [2021-08-21 17:06:08,792 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-08-21 17:06:08,792 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:08,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-08-21 17:06:08,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-08-21 17:06:08,793 INFO L87 Difference]: Start difference. First operand 1348 states and 2694 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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-21 17:06:08,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:08,909 INFO L93 Difference]: Finished difference Result 2194 states and 4735 transitions. [2021-08-21 17:06:08,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-08-21 17:06:08,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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 76 [2021-08-21 17:06:08,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:08,913 INFO L225 Difference]: With dead ends: 2194 [2021-08-21 17:06:08,913 INFO L226 Difference]: Without dead ends: 1336 [2021-08-21 17:06:08,913 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 85.6ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:06:08,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1336 states. [2021-08-21 17:06:08,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1336 to 1240. [2021-08-21 17:06:08,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1240 states, 1210 states have (on average 2.0760330578512396) internal successors, (2512), 1239 states have internal predecessors, (2512), 0 states have call successors, (0), 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-21 17:06:08,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1240 states to 1240 states and 2512 transitions. [2021-08-21 17:06:08,936 INFO L78 Accepts]: Start accepts. Automaton has 1240 states and 2512 transitions. Word has length 76 [2021-08-21 17:06:08,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:08,936 INFO L470 AbstractCegarLoop]: Abstraction has 1240 states and 2512 transitions. [2021-08-21 17:06:08,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 6 states have internal predecessors, (76), 0 states have call successors, (0), 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-21 17:06:08,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1240 states and 2512 transitions. [2021-08-21 17:06:08,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 17:06:08,939 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:08,939 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:08,939 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-08-21 17:06:08,939 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:08,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:08,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1257513367, now seen corresponding path program 1 times [2021-08-21 17:06:08,940 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:08,940 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090958696] [2021-08-21 17:06:08,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:08,940 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:08,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:09,151 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-21 17:06:09,151 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:09,152 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090958696] [2021-08-21 17:06:09,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090958696] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:09,152 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:09,152 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-08-21 17:06:09,152 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763995146] [2021-08-21 17:06:09,152 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2021-08-21 17:06:09,153 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:09,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-08-21 17:06:09,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-08-21 17:06:09,153 INFO L87 Difference]: Start difference. First operand 1240 states and 2512 transitions. Second operand has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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-21 17:06:09,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:09,485 INFO L93 Difference]: Finished difference Result 1976 states and 4141 transitions. [2021-08-21 17:06:09,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-08-21 17:06:09,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-08-21 17:06:09,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:09,490 INFO L225 Difference]: With dead ends: 1976 [2021-08-21 17:06:09,490 INFO L226 Difference]: Without dead ends: 1296 [2021-08-21 17:06:09,491 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 253.9ms TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2021-08-21 17:06:09,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1296 states. [2021-08-21 17:06:09,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1296 to 1110. [2021-08-21 17:06:09,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1110 states, 1080 states have (on average 2.064814814814815) internal successors, (2230), 1109 states have internal predecessors, (2230), 0 states have call successors, (0), 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-21 17:06:09,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1110 states to 1110 states and 2230 transitions. [2021-08-21 17:06:09,513 INFO L78 Accepts]: Start accepts. Automaton has 1110 states and 2230 transitions. Word has length 77 [2021-08-21 17:06:09,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:09,513 INFO L470 AbstractCegarLoop]: Abstraction has 1110 states and 2230 transitions. [2021-08-21 17:06:09,513 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.0) internal successors, (77), 11 states have internal predecessors, (77), 0 states have call successors, (0), 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-21 17:06:09,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1110 states and 2230 transitions. [2021-08-21 17:06:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-08-21 17:06:09,515 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:09,516 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-08-21 17:06:09,516 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-08-21 17:06:09,516 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:09,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -361808279, now seen corresponding path program 2 times [2021-08-21 17:06:09,517 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:09,517 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702099171] [2021-08-21 17:06:09,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:09,517 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:09,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-08-21 17:06:09,642 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-21 17:06:09,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-08-21 17:06:09,642 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702099171] [2021-08-21 17:06:09,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702099171] provided 1 perfect and 0 imperfect interpolant sequences [2021-08-21 17:06:09,642 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-08-21 17:06:09,642 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-08-21 17:06:09,643 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326380154] [2021-08-21 17:06:09,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-08-21 17:06:09,643 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-08-21 17:06:09,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-08-21 17:06:09,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-08-21 17:06:09,644 INFO L87 Difference]: Start difference. First operand 1110 states and 2230 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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-21 17:06:09,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-08-21 17:06:09,776 INFO L93 Difference]: Finished difference Result 684 states and 1152 transitions. [2021-08-21 17:06:09,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-08-21 17:06:09,776 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2021-08-21 17:06:09,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-08-21 17:06:09,777 INFO L225 Difference]: With dead ends: 684 [2021-08-21 17:06:09,778 INFO L226 Difference]: Without dead ends: 292 [2021-08-21 17:06:09,778 INFO L781 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 106.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-08-21 17:06:09,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2021-08-21 17:06:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 284. [2021-08-21 17:06:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 284 states, 275 states have (on average 1.6727272727272726) internal successors, (460), 283 states have internal predecessors, (460), 0 states have call successors, (0), 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-21 17:06:09,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 460 transitions. [2021-08-21 17:06:09,782 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 460 transitions. Word has length 77 [2021-08-21 17:06:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-08-21 17:06:09,783 INFO L470 AbstractCegarLoop]: Abstraction has 284 states and 460 transitions. [2021-08-21 17:06:09,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 8 states have internal predecessors, (77), 0 states have call successors, (0), 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-21 17:06:09,783 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 460 transitions. [2021-08-21 17:06:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-08-21 17:06:09,784 INFO L504 BasicCegarLoop]: Found error trace [2021-08-21 17:06:09,784 INFO L512 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 17:06:09,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-08-21 17:06:09,784 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION (and 3 more)] === [2021-08-21 17:06:09,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-08-21 17:06:09,785 INFO L82 PathProgramCache]: Analyzing trace with hash -808151321, now seen corresponding path program 1 times [2021-08-21 17:06:09,785 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-08-21 17:06:09,785 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357617970] [2021-08-21 17:06:09,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-08-21 17:06:09,785 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-08-21 17:06:09,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:06:09,819 INFO L354 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-08-21 17:06:09,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-08-21 17:06:09,889 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-08-21 17:06:09,890 INFO L626 BasicCegarLoop]: Counterexample is feasible [2021-08-21 17:06:09,891 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:06:09,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:06:09,892 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATION [2021-08-21 17:06:09,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATION [2021-08-21 17:06:09,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATION [2021-08-21 17:06:09,893 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0ASSERT_VIOLATIONERROR_FUNCTION [2021-08-21 17:06:09,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-08-21 17:06:09,898 INFO L229 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-08-21 17:06:09,898 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-08-21 17:06:10,024 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 21.08 05:06:10 BasicIcfg [2021-08-21 17:06:10,024 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-08-21 17:06:10,026 INFO L168 Benchmark]: Toolchain (without parser) took 11490.03 ms. Allocated memory was 189.8 MB in the beginning and 571.5 MB in the end (delta: 381.7 MB). Free memory was 153.3 MB in the beginning and 464.9 MB in the end (delta: -311.6 MB). Peak memory consumption was 398.8 MB. Max. memory is 8.0 GB. [2021-08-21 17:06:10,026 INFO L168 Benchmark]: CDTParser took 0.56 ms. Allocated memory is still 189.8 MB. Free memory is still 171.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-08-21 17:06:10,026 INFO L168 Benchmark]: CACSL2BoogieTranslator took 630.92 ms. Allocated memory is still 189.8 MB. Free memory was 153.0 MB in the beginning and 159.1 MB in the end (delta: -6.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. [2021-08-21 17:06:10,026 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 189.8 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:06:10,027 INFO L168 Benchmark]: Boogie Preprocessor took 57.71 ms. Allocated memory is still 189.8 MB. Free memory was 156.5 MB in the beginning and 154.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-08-21 17:06:10,027 INFO L168 Benchmark]: RCFGBuilder took 1924.86 ms. Allocated memory was 189.8 MB in the beginning and 239.1 MB in the end (delta: 49.3 MB). Free memory was 154.4 MB in the beginning and 180.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 86.8 MB. Max. memory is 8.0 GB. [2021-08-21 17:06:10,027 INFO L168 Benchmark]: TraceAbstraction took 8807.46 ms. Allocated memory was 239.1 MB in the beginning and 571.5 MB in the end (delta: 332.4 MB). Free memory was 179.8 MB in the beginning and 464.9 MB in the end (delta: -285.2 MB). Peak memory consumption was 376.5 MB. Max. memory is 8.0 GB. [2021-08-21 17:06:10,029 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.56 ms. Allocated memory is still 189.8 MB. Free memory is still 171.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 630.92 ms. Allocated memory is still 189.8 MB. Free memory was 153.0 MB in the beginning and 159.1 MB in the end (delta: -6.1 MB). Peak memory consumption was 11.5 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 63.53 ms. Allocated memory is still 189.8 MB. Free memory was 159.1 MB in the beginning and 156.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 57.71 ms. Allocated memory is still 189.8 MB. Free memory was 156.5 MB in the beginning and 154.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1924.86 ms. Allocated memory was 189.8 MB in the beginning and 239.1 MB in the end (delta: 49.3 MB). Free memory was 154.4 MB in the beginning and 180.3 MB in the end (delta: -25.9 MB). Peak memory consumption was 86.8 MB. Max. memory is 8.0 GB. * TraceAbstraction took 8807.46 ms. Allocated memory was 239.1 MB in the beginning and 571.5 MB in the end (delta: 332.4 MB). Free memory was 179.8 MB in the beginning and 464.9 MB in the end (delta: -285.2 MB). Peak memory consumption was 376.5 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 37571, positive: 35568, positive conditional: 35568, positive unconditional: 0, negative: 2003, negative conditional: 2003, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 37006, positive: 35568, positive conditional: 0, positive unconditional: 35568, negative: 1438, negative conditional: 0, negative unconditional: 1438, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1080, positive: 1047, positive conditional: 0, positive unconditional: 1047, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1080, positive: 1043, positive conditional: 0, positive unconditional: 1043, negative: 37, negative conditional: 0, negative unconditional: 37, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 37, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 33, negative conditional: 0, negative unconditional: 33, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 443, positive: 8, positive conditional: 0, positive unconditional: 8, negative: 435, negative conditional: 0, negative unconditional: 435, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 37006, positive: 34521, positive conditional: 0, positive unconditional: 34521, negative: 1405, negative conditional: 0, negative unconditional: 1405, unknown: 1080, unknown conditional: 0, unknown unconditional: 1080] , Statistics on independence cache: Total cache size (in pairs): 1080, Positive cache size: 1047, Positive conditional cache size: 0, Positive unconditional cache size: 1047, Negative cache size: 33, Negative conditional cache size: 0, Negative unconditional cache size: 33, Independence queries for same thread: 565 - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0ms ErrorAutomatonConstructionTimeTotal, 0.0ms FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0ms ErrorAutomatonConstructionTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeAvg, 0.0ms ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=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] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1510; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1510, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1511; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1511, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1512; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1512, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] 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) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] 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) [L762] 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) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 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 [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 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 [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 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) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 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) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 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) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 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) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 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) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 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) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, 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_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - 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: 818]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 814]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 816]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. OverallTime: 8570.3ms, OverallIterations: 13, TraceHistogramMax: 1, EmptinessCheckTime: 170.0ms, AutomataDifference: 3057.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1437.6ms, PartialOrderReductionTime: 1420.4ms, HoareTripleCheckerStatistics: 1438 SDtfs, 2023 SDslu, 5060 SDs, 0 SdLazy, 774 SolverSat, 164 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 892.6ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 333 ImplicationChecksByTransitivity, 1839.7ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=10392occurred in iteration=0, InterpolantAutomatonStates: 137, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 1083.7ms AutomataMinimizationTime, 12 MinimizatonAttempts, 599 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 61.3ms SsaConstructionTime, 555.4ms SatisfiabilityAnalysisTime, 1839.2ms InterpolantComputationTime, 931 NumberOfCodeBlocks, 931 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 838 ConstructedInterpolants, 0 QuantifiedInterpolants, 3815 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-08-21 17:06:10,073 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...