/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/safe031_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-98196c323137eee61a7c1131837b356358d783d4-98196c3 [2021-06-16 15:50:21,270 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-06-16 15:50:21,272 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-06-16 15:50:21,301 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-06-16 15:50:21,301 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-06-16 15:50:21,304 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-06-16 15:50:21,306 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-06-16 15:50:21,311 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-06-16 15:50:21,313 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-06-16 15:50:21,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-06-16 15:50:21,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-06-16 15:50:21,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-06-16 15:50:21,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-06-16 15:50:21,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-06-16 15:50:21,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-06-16 15:50:21,322 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-06-16 15:50:21,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-06-16 15:50:21,325 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-06-16 15:50:21,326 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-06-16 15:50:21,331 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-06-16 15:50:21,333 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-06-16 15:50:21,334 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-06-16 15:50:21,335 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-06-16 15:50:21,336 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-06-16 15:50:21,341 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-06-16 15:50:21,341 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-06-16 15:50:21,342 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-06-16 15:50:21,343 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-06-16 15:50:21,343 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-06-16 15:50:21,344 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-06-16 15:50:21,344 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-06-16 15:50:21,344 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-06-16 15:50:21,346 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-06-16 15:50:21,346 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-06-16 15:50:21,347 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-06-16 15:50:21,347 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-06-16 15:50:21,348 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-06-16 15:50:21,348 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-06-16 15:50:21,348 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-06-16 15:50:21,348 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-06-16 15:50:21,349 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-06-16 15:50:21,350 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-06-16 15:50:21,379 INFO L113 SettingsManager]: Loading preferences was successful [2021-06-16 15:50:21,379 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-06-16 15:50:21,381 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-06-16 15:50:21,381 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-06-16 15:50:21,382 INFO L138 SettingsManager]: * Use SBE=true [2021-06-16 15:50:21,382 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-06-16 15:50:21,382 INFO L138 SettingsManager]: * sizeof long=4 [2021-06-16 15:50:21,382 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-06-16 15:50:21,382 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-06-16 15:50:21,382 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-06-16 15:50:21,383 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-06-16 15:50:21,383 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-06-16 15:50:21,383 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-06-16 15:50:21,383 INFO L138 SettingsManager]: * sizeof long double=12 [2021-06-16 15:50:21,383 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-06-16 15:50:21,383 INFO L138 SettingsManager]: * Use constant arrays=true [2021-06-16 15:50:21,384 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-06-16 15:50:21,384 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-06-16 15:50:21,384 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-06-16 15:50:21,384 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-06-16 15:50:21,384 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-06-16 15:50:21,384 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:50:21,384 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-06-16 15:50:21,385 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-06-16 15:50:21,385 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-06-16 15:50:21,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-06-16 15:50:21,716 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-06-16 15:50:21,718 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-06-16 15:50:21,719 INFO L271 PluginConnector]: Initializing CDTParser... [2021-06-16 15:50:21,720 INFO L275 PluginConnector]: CDTParser initialized [2021-06-16 15:50:21,720 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2021-06-16 15:50:21,765 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670a3146e/7f2db34f2ea54ab18b42da01aec9f89c/FLAGe8fd114f7 [2021-06-16 15:50:22,245 INFO L306 CDTParser]: Found 1 translation units. [2021-06-16 15:50:22,246 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i [2021-06-16 15:50:22,266 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670a3146e/7f2db34f2ea54ab18b42da01aec9f89c/FLAGe8fd114f7 [2021-06-16 15:50:22,281 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/670a3146e/7f2db34f2ea54ab18b42da01aec9f89c [2021-06-16 15:50:22,283 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-06-16 15:50:22,285 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-06-16 15:50:22,287 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-06-16 15:50:22,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-06-16 15:50:22,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-06-16 15:50:22,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,291 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ff96e0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22, skipping insertion in model container [2021-06-16 15:50:22,291 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,296 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-06-16 15:50:22,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-06-16 15:50:22,496 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i[949,962] [2021-06-16 15:50:22,609 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:50:22,622 INFO L203 MainTranslator]: Completed pre-run [2021-06-16 15:50:22,631 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.opt.i[949,962] [2021-06-16 15:50:22,690 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-06-16 15:50:22,744 INFO L208 MainTranslator]: Completed translation [2021-06-16 15:50:22,744 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22 WrapperNode [2021-06-16 15:50:22,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-06-16 15:50:22,746 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-06-16 15:50:22,747 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-06-16 15:50:22,747 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-06-16 15:50:22,752 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,784 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,822 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-06-16 15:50:22,822 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-06-16 15:50:22,823 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-06-16 15:50:22,823 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-06-16 15:50:22,828 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,828 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,831 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,839 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,849 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... [2021-06-16 15:50:22,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-06-16 15:50:22,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-06-16 15:50:22,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-06-16 15:50:22,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-06-16 15:50:22,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-06-16 15:50:22,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-06-16 15:50:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-06-16 15:50:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-06-16 15:50:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-06-16 15:50:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-06-16 15:50:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-06-16 15:50:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-06-16 15:50:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-06-16 15:50:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-06-16 15:50:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-06-16 15:50:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-06-16 15:50:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-06-16 15:50:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-06-16 15:50:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-06-16 15:50:22,914 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-06-16 15:50:24,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-06-16 15:50:24,286 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-06-16 15:50:24,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:50:24 BoogieIcfgContainer [2021-06-16 15:50:24,288 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-06-16 15:50:24,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-06-16 15:50:24,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-06-16 15:50:24,292 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-06-16 15:50:24,292 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.06 03:50:22" (1/3) ... [2021-06-16 15:50:24,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ea9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:50:24, skipping insertion in model container [2021-06-16 15:50:24,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.06 03:50:22" (2/3) ... [2021-06-16 15:50:24,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@156ea9d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.06 03:50:24, skipping insertion in model container [2021-06-16 15:50:24,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.06 03:50:24" (3/3) ... [2021-06-16 15:50:24,294 INFO L111 eAbstractionObserver]: Analyzing ICFG safe031_rmo.opt.i [2021-06-16 15:50:24,300 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-06-16 15:50:24,301 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-06-16 15:50:24,301 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-06-16 15:50:24,301 INFO L470 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-06-16 15:50:24,330 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,331 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,332 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,332 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,332 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,333 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,334 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,335 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,336 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,337 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,338 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,339 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,340 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,341 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,342 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,343 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,344 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,344 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,344 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,346 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,346 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,347 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,347 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,348 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,349 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-06-16 15:50:24,352 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-06-16 15:50:24,367 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:50:24,386 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:50:24,386 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:50:24,391 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:50:24,392 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:50:24,392 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:50:24,392 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:50:24,392 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:50:24,392 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2Thread1of1ForFork0======== [2021-06-16 15:50:25,587 INFO L276 IsEmpty]: Start isEmpty. Operand has 14088 states, 12294 states have (on average 2.4691719537986008) internal successors, (30356), 14087 states have internal predecessors, (30356), 0 states have call successors, (0), 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-06-16 15:50:25,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-06-16 15:50:25,595 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:25,595 INFO L472 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-06-16 15:50:25,595 INFO L430 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:25,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:25,600 INFO L82 PathProgramCache]: Analyzing trace with hash -575217819, now seen corresponding path program 1 times [2021-06-16 15:50:25,605 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:25,605 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071080016] [2021-06-16 15:50:25,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:25,845 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:25,845 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:25,846 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:25,847 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:25,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:25,854 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:25,854 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071080016] [2021-06-16 15:50:25,854 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071080016] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:25,854 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:25,854 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-06-16 15:50:25,855 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717295113] [2021-06-16 15:50:25,857 INFO L462 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-06-16 15:50:25,857 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:25,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-06-16 15:50:25,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:50:25,898 INFO L87 Difference]: Start difference. First operand has 14088 states, 12294 states have (on average 2.4691719537986008) internal successors, (30356), 14087 states have internal predecessors, (30356), 0 states have call successors, (0), 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-06-16 15:50:26,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:26,023 INFO L93 Difference]: Finished difference Result 12128 states and 24605 transitions. [2021-06-16 15:50:26,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-06-16 15:50:26,025 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-06-16 15:50:26,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:26,028 INFO L225 Difference]: With dead ends: 12128 [2021-06-16 15:50:26,028 INFO L226 Difference]: Without dead ends: 0 [2021-06-16 15:50:26,029 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-06-16 15:50:26,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2021-06-16 15:50:26,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2021-06-16 15:50:26,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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-06-16 15:50:26,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2021-06-16 15:50:26,044 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 55 [2021-06-16 15:50:26,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:26,044 INFO L482 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2021-06-16 15:50:26,044 INFO L483 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-06-16 15:50:26,044 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2021-06-16 15:50:26,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:50:26,044 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-06-16 15:50:26,045 INFO L301 ceAbstractionStarter]: Result for error location P2Thread1of1ForFork0 was SAFE (1/3) [2021-06-16 15:50:26,046 INFO L255 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-06-16 15:50:26,049 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:50:26,049 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:50:26,049 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:50:26,049 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:50:26,049 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:50:26,049 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:50:26,049 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:50:26,050 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == P2======== [2021-06-16 15:50:27,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 14088 states, 12294 states have (on average 2.4691719537986008) internal successors, (30356), 14087 states have internal predecessors, (30356), 0 states have call successors, (0), 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-06-16 15:50:27,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2021-06-16 15:50:27,055 INFO L301 ceAbstractionStarter]: Result for error location P2 was SAFE (2/3) [2021-06-16 15:50:27,056 INFO L255 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2021-06-16 15:50:27,057 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-06-16 15:50:27,057 INFO L379 AbstractCegarLoop]: Hoare is false [2021-06-16 15:50:27,057 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-06-16 15:50:27,057 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-06-16 15:50:27,057 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-06-16 15:50:27,057 INFO L383 AbstractCegarLoop]: Difference is false [2021-06-16 15:50:27,057 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-06-16 15:50:27,057 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-06-16 15:50:27,969 INFO L276 IsEmpty]: Start isEmpty. Operand has 14088 states, 12294 states have (on average 2.4691719537986008) internal successors, (30356), 14087 states have internal predecessors, (30356), 0 states have call successors, (0), 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-06-16 15:50:27,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2021-06-16 15:50:27,977 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:27,977 INFO L472 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-06-16 15:50:27,978 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:27,978 INFO L82 PathProgramCache]: Analyzing trace with hash 1295563138, now seen corresponding path program 1 times [2021-06-16 15:50:27,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:27,979 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1015759613] [2021-06-16 15:50:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:28,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:28,108 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:28,109 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,109 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:28,114 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,115 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:28,120 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,121 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:28,133 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-06-16 15:50:28,134 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-06-16 15:50:28,141 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:28,142 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:28,154 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,155 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:28,161 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,162 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:28,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,170 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:28,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:28,170 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:28,170 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1015759613] [2021-06-16 15:50:28,171 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1015759613] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:28,171 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:28,171 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-16 15:50:28,171 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417679662] [2021-06-16 15:50:28,171 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-16 15:50:28,171 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:28,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-16 15:50:28,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-16 15:50:28,189 INFO L87 Difference]: Start difference. First operand has 14088 states, 12294 states have (on average 2.4691719537986008) internal successors, (30356), 14087 states have internal predecessors, (30356), 0 states have call successors, (0), 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 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06-16 15:50:28,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:28,489 INFO L93 Difference]: Finished difference Result 20031 states and 44267 transitions. [2021-06-16 15:50:28,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-16 15:50:28,489 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06-16 15:50:28,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:28,522 INFO L225 Difference]: With dead ends: 20031 [2021-06-16 15:50:28,522 INFO L226 Difference]: Without dead ends: 5106 [2021-06-16 15:50:28,524 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 140.5ms TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2021-06-16 15:50:28,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5106 states. [2021-06-16 15:50:28,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5106 to 5043. [2021-06-16 15:50:28,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5043 states, 4982 states have (on average 2.301686069851465) internal successors, (11467), 5042 states have internal predecessors, (11467), 0 states have call successors, (0), 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-06-16 15:50:28,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5043 states to 5043 states and 11467 transitions. [2021-06-16 15:50:28,680 INFO L78 Accepts]: Start accepts. Automaton has 5043 states and 11467 transitions. Word has length 67 [2021-06-16 15:50:28,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:28,681 INFO L482 AbstractCegarLoop]: Abstraction has 5043 states and 11467 transitions. [2021-06-16 15:50:28,681 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 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-06-16 15:50:28,681 INFO L276 IsEmpty]: Start isEmpty. Operand 5043 states and 11467 transitions. [2021-06-16 15:50:28,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-16 15:50:28,686 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:28,686 INFO L472 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-06-16 15:50:28,686 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-06-16 15:50:28,686 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:28,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:28,687 INFO L82 PathProgramCache]: Analyzing trace with hash -2061888797, now seen corresponding path program 1 times [2021-06-16 15:50:28,689 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:28,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207667292] [2021-06-16 15:50:28,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:28,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:28,809 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:28,810 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,810 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:28,813 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,813 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:28,817 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,818 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:28,822 INFO L142 QuantifierPusher]: treesize reduction 17, result has 51.4 percent of original size [2021-06-16 15:50:28,823 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 18 [2021-06-16 15:50:28,824 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:28,824 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:28,824 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:28,824 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:28,824 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207667292] [2021-06-16 15:50:28,825 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207667292] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:28,825 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:28,825 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-06-16 15:50:28,825 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1445208605] [2021-06-16 15:50:28,825 INFO L462 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-06-16 15:50:28,826 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:28,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-06-16 15:50:28,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-16 15:50:28,826 INFO L87 Difference]: Start difference. First operand 5043 states and 11467 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-06-16 15:50:28,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:28,869 INFO L93 Difference]: Finished difference Result 4490 states and 9991 transitions. [2021-06-16 15:50:28,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-06-16 15:50:28,870 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-06-16 15:50:28,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:28,886 INFO L225 Difference]: With dead ends: 4490 [2021-06-16 15:50:28,886 INFO L226 Difference]: Without dead ends: 4490 [2021-06-16 15:50:28,886 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 8.6ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-06-16 15:50:28,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4490 states. [2021-06-16 15:50:29,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4490 to 4490. [2021-06-16 15:50:29,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4490 states, 4434 states have (on average 2.253270184934596) internal successors, (9991), 4489 states have internal predecessors, (9991), 0 states have call successors, (0), 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-06-16 15:50:29,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4490 states to 4490 states and 9991 transitions. [2021-06-16 15:50:29,046 INFO L78 Accepts]: Start accepts. Automaton has 4490 states and 9991 transitions. Word has length 69 [2021-06-16 15:50:29,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:29,047 INFO L482 AbstractCegarLoop]: Abstraction has 4490 states and 9991 transitions. [2021-06-16 15:50:29,047 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 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-06-16 15:50:29,047 INFO L276 IsEmpty]: Start isEmpty. Operand 4490 states and 9991 transitions. [2021-06-16 15:50:29,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2021-06-16 15:50:29,052 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:29,053 INFO L472 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-06-16 15:50:29,053 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-06-16 15:50:29,053 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:29,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:29,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1174385116, now seen corresponding path program 1 times [2021-06-16 15:50:29,054 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:29,054 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846399175] [2021-06-16 15:50:29,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:29,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:29,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,166 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:29,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:29,169 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,169 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:29,174 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,175 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:29,182 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-16 15:50:29,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-16 15:50:29,188 INFO L142 QuantifierPusher]: treesize reduction 14, result has 75.9 percent of original size [2021-06-16 15:50:29,189 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 44 [2021-06-16 15:50:29,202 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:29,203 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:29,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:29,224 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,224 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:29,232 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,233 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:29,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:29,233 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:29,233 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846399175] [2021-06-16 15:50:29,233 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846399175] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:29,234 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:29,234 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-06-16 15:50:29,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505330428] [2021-06-16 15:50:29,234 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-06-16 15:50:29,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:29,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-06-16 15:50:29,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-06-16 15:50:29,237 INFO L87 Difference]: Start difference. First operand 4490 states and 9991 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-06-16 15:50:29,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:29,414 INFO L93 Difference]: Finished difference Result 5134 states and 11813 transitions. [2021-06-16 15:50:29,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-06-16 15:50:29,414 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-06-16 15:50:29,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:29,429 INFO L225 Difference]: With dead ends: 5134 [2021-06-16 15:50:29,429 INFO L226 Difference]: Without dead ends: 4238 [2021-06-16 15:50:29,430 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 124.2ms TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2021-06-16 15:50:29,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4238 states. [2021-06-16 15:50:29,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4238 to 4238. [2021-06-16 15:50:29,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4238 states, 4182 states have (on average 2.193926351028216) internal successors, (9175), 4237 states have internal predecessors, (9175), 0 states have call successors, (0), 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-06-16 15:50:29,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4238 states to 4238 states and 9175 transitions. [2021-06-16 15:50:29,520 INFO L78 Accepts]: Start accepts. Automaton has 4238 states and 9175 transitions. Word has length 69 [2021-06-16 15:50:29,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:29,521 INFO L482 AbstractCegarLoop]: Abstraction has 4238 states and 9175 transitions. [2021-06-16 15:50:29,521 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 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-06-16 15:50:29,521 INFO L276 IsEmpty]: Start isEmpty. Operand 4238 states and 9175 transitions. [2021-06-16 15:50:29,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2021-06-16 15:50:29,525 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:29,525 INFO L472 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-06-16 15:50:29,526 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-06-16 15:50:29,526 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:29,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:29,526 INFO L82 PathProgramCache]: Analyzing trace with hash 1871657391, now seen corresponding path program 1 times [2021-06-16 15:50:29,526 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:29,526 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291250661] [2021-06-16 15:50:29,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:29,578 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,579 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:29,579 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,580 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:29,583 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:29,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:29,598 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,598 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:29,606 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,607 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:29,615 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,616 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:29,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:29,616 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:29,616 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291250661] [2021-06-16 15:50:29,617 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291250661] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:29,617 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:29,617 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:50:29,617 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157011740] [2021-06-16 15:50:29,617 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:50:29,617 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:29,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:50:29,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:50:29,618 INFO L87 Difference]: Start difference. First operand 4238 states and 9175 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-06-16 15:50:29,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:29,739 INFO L93 Difference]: Finished difference Result 4898 states and 11024 transitions. [2021-06-16 15:50:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:50:29,740 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-06-16 15:50:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:29,753 INFO L225 Difference]: With dead ends: 4898 [2021-06-16 15:50:29,754 INFO L226 Difference]: Without dead ends: 4058 [2021-06-16 15:50:29,754 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 82.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:29,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4058 states. [2021-06-16 15:50:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4058 to 4058. [2021-06-16 15:50:29,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4058 states, 4002 states have (on average 2.1786606696651676) internal successors, (8719), 4057 states have internal predecessors, (8719), 0 states have call successors, (0), 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-06-16 15:50:29,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4058 states to 4058 states and 8719 transitions. [2021-06-16 15:50:29,842 INFO L78 Accepts]: Start accepts. Automaton has 4058 states and 8719 transitions. Word has length 70 [2021-06-16 15:50:29,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:29,842 INFO L482 AbstractCegarLoop]: Abstraction has 4058 states and 8719 transitions. [2021-06-16 15:50:29,842 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 6 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-06-16 15:50:29,842 INFO L276 IsEmpty]: Start isEmpty. Operand 4058 states and 8719 transitions. [2021-06-16 15:50:29,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-06-16 15:50:29,847 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:29,847 INFO L472 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-06-16 15:50:29,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-06-16 15:50:29,847 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:29,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:29,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1264238747, now seen corresponding path program 1 times [2021-06-16 15:50:29,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:29,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663628958] [2021-06-16 15:50:29,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:29,947 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,947 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:29,948 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,948 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:29,952 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:29,954 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:29,966 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,967 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:29,973 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,976 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:29,983 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:29,984 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:29,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:29,984 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:29,985 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663628958] [2021-06-16 15:50:29,985 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663628958] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:29,985 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:29,985 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:50:29,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176684446] [2021-06-16 15:50:29,985 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:50:29,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:29,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:50:29,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:50:29,988 INFO L87 Difference]: Start difference. First operand 4058 states and 8719 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06-16 15:50:30,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:30,111 INFO L93 Difference]: Finished difference Result 6122 states and 14188 transitions. [2021-06-16 15:50:30,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:50:30,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06-16 15:50:30,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:30,138 INFO L225 Difference]: With dead ends: 6122 [2021-06-16 15:50:30,138 INFO L226 Difference]: Without dead ends: 3416 [2021-06-16 15:50:30,138 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 80.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:30,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2021-06-16 15:50:30,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 2916. [2021-06-16 15:50:30,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2876 states have (on average 2.2451321279554937) internal successors, (6457), 2915 states have internal predecessors, (6457), 0 states have call successors, (0), 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-06-16 15:50:30,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 6457 transitions. [2021-06-16 15:50:30,212 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 6457 transitions. Word has length 71 [2021-06-16 15:50:30,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:30,212 INFO L482 AbstractCegarLoop]: Abstraction has 2916 states and 6457 transitions. [2021-06-16 15:50:30,212 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 6 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-06-16 15:50:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 6457 transitions. [2021-06-16 15:50:30,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-16 15:50:30,216 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:30,216 INFO L472 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] [2021-06-16 15:50:30,216 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-06-16 15:50:30,216 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:30,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:30,217 INFO L82 PathProgramCache]: Analyzing trace with hash 288523598, now seen corresponding path program 1 times [2021-06-16 15:50:30,217 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:30,217 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899105421] [2021-06-16 15:50:30,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:30,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:30,281 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,281 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:30,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,282 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:30,286 INFO L142 QuantifierPusher]: treesize reduction 10, result has 79.2 percent of original size [2021-06-16 15:50:30,286 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 38 [2021-06-16 15:50:30,293 INFO L142 QuantifierPusher]: treesize reduction 10, result has 80.4 percent of original size [2021-06-16 15:50:30,294 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 41 [2021-06-16 15:50:30,304 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:30,304 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:30,316 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,317 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:30,324 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,325 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:30,332 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,332 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:30,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:30,333 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:30,333 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899105421] [2021-06-16 15:50:30,333 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899105421] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:30,333 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:30,333 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:50:30,333 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470367957] [2021-06-16 15:50:30,333 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:50:30,333 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:30,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:50:30,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:50:30,334 INFO L87 Difference]: Start difference. First operand 2916 states and 6457 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-06-16 15:50:30,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:30,535 INFO L93 Difference]: Finished difference Result 3528 states and 8158 transitions. [2021-06-16 15:50:30,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-06-16 15:50:30,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-06-16 15:50:30,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:30,542 INFO L225 Difference]: With dead ends: 3528 [2021-06-16 15:50:30,542 INFO L226 Difference]: Without dead ends: 2928 [2021-06-16 15:50:30,543 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 132.0ms TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2021-06-16 15:50:30,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2021-06-16 15:50:30,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2921. [2021-06-16 15:50:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2921 states, 2881 states have (on average 2.2457480041652205) internal successors, (6470), 2920 states have internal predecessors, (6470), 0 states have call successors, (0), 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-06-16 15:50:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2921 states to 2921 states and 6470 transitions. [2021-06-16 15:50:30,599 INFO L78 Accepts]: Start accepts. Automaton has 2921 states and 6470 transitions. Word has length 72 [2021-06-16 15:50:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:30,600 INFO L482 AbstractCegarLoop]: Abstraction has 2921 states and 6470 transitions. [2021-06-16 15:50:30,600 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 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-06-16 15:50:30,600 INFO L276 IsEmpty]: Start isEmpty. Operand 2921 states and 6470 transitions. [2021-06-16 15:50:30,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2021-06-16 15:50:30,603 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:30,603 INFO L472 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] [2021-06-16 15:50:30,603 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-06-16 15:50:30,603 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:30,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:30,604 INFO L82 PathProgramCache]: Analyzing trace with hash -1361785004, now seen corresponding path program 2 times [2021-06-16 15:50:30,604 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:30,604 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574848322] [2021-06-16 15:50:30,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:30,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:30,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,649 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:30,649 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,650 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:30,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:30,657 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:30,665 INFO L142 QuantifierPusher]: treesize reduction 20, result has 79.6 percent of original size [2021-06-16 15:50:30,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 78 [2021-06-16 15:50:30,672 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:30,673 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:30,685 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,685 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:30,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,693 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:30,700 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:30,700 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:30,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:30,701 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:30,701 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574848322] [2021-06-16 15:50:30,701 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574848322] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:30,701 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:30,701 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-16 15:50:30,701 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102299918] [2021-06-16 15:50:30,702 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-16 15:50:30,702 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:30,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-16 15:50:30,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-16 15:50:30,702 INFO L87 Difference]: Start difference. First operand 2921 states and 6470 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 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-06-16 15:50:30,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:30,966 INFO L93 Difference]: Finished difference Result 3461 states and 8006 transitions. [2021-06-16 15:50:30,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-06-16 15:50:30,969 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 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 72 [2021-06-16 15:50:30,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:30,974 INFO L225 Difference]: With dead ends: 3461 [2021-06-16 15:50:30,974 INFO L226 Difference]: Without dead ends: 2861 [2021-06-16 15:50:30,975 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 159.8ms TimeCoverageRelationStatistics Valid=97, Invalid=175, Unknown=0, NotChecked=0, Total=272 [2021-06-16 15:50:30,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2861 states. [2021-06-16 15:50:31,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2861 to 2856. [2021-06-16 15:50:31,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2856 states, 2816 states have (on average 2.2418323863636362) internal successors, (6313), 2855 states have internal predecessors, (6313), 0 states have call successors, (0), 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-06-16 15:50:31,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2856 states to 2856 states and 6313 transitions. [2021-06-16 15:50:31,026 INFO L78 Accepts]: Start accepts. Automaton has 2856 states and 6313 transitions. Word has length 72 [2021-06-16 15:50:31,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:31,026 INFO L482 AbstractCegarLoop]: Abstraction has 2856 states and 6313 transitions. [2021-06-16 15:50:31,026 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 8 states have internal predecessors, (72), 0 states have call successors, (0), 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-06-16 15:50:31,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2856 states and 6313 transitions. [2021-06-16 15:50:31,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2021-06-16 15:50:31,030 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:31,030 INFO L472 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-06-16 15:50:31,030 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-06-16 15:50:31,030 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:31,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:31,030 INFO L82 PathProgramCache]: Analyzing trace with hash 665081544, now seen corresponding path program 1 times [2021-06-16 15:50:31,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:31,031 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679035648] [2021-06-16 15:50:31,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:31,073 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,074 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,074 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,078 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:50:31,078 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:50:31,091 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,091 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:31,097 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:50:31,097 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:31,103 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,104 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:31,104 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:31,104 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [679035648] [2021-06-16 15:50:31,105 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [679035648] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:31,105 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:31,105 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-06-16 15:50:31,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297600672] [2021-06-16 15:50:31,105 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-06-16 15:50:31,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:31,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-06-16 15:50:31,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-06-16 15:50:31,106 INFO L87 Difference]: Start difference. First operand 2856 states and 6313 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-06-16 15:50:31,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:31,185 INFO L93 Difference]: Finished difference Result 3240 states and 6836 transitions. [2021-06-16 15:50:31,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:50:31,186 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-06-16 15:50:31,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:31,190 INFO L225 Difference]: With dead ends: 3240 [2021-06-16 15:50:31,190 INFO L226 Difference]: Without dead ends: 2386 [2021-06-16 15:50:31,191 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 64.5ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:31,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2386 states. [2021-06-16 15:50:31,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2386 to 2386. [2021-06-16 15:50:31,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2386 states, 2346 states have (on average 2.2365728900255752) internal successors, (5247), 2385 states have internal predecessors, (5247), 0 states have call successors, (0), 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-06-16 15:50:31,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2386 states to 2386 states and 5247 transitions. [2021-06-16 15:50:31,261 INFO L78 Accepts]: Start accepts. Automaton has 2386 states and 5247 transitions. Word has length 73 [2021-06-16 15:50:31,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:31,261 INFO L482 AbstractCegarLoop]: Abstraction has 2386 states and 5247 transitions. [2021-06-16 15:50:31,261 INFO L483 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-06-16 15:50:31,261 INFO L276 IsEmpty]: Start isEmpty. Operand 2386 states and 5247 transitions. [2021-06-16 15:50:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2021-06-16 15:50:31,264 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:31,264 INFO L472 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-06-16 15:50:31,265 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-06-16 15:50:31,265 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:31,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:31,265 INFO L82 PathProgramCache]: Analyzing trace with hash 2137907762, now seen corresponding path program 1 times [2021-06-16 15:50:31,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:31,265 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82077737] [2021-06-16 15:50:31,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:31,301 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,302 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,302 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,305 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,306 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,309 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:50:31,310 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:50:31,321 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,321 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:31,328 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:50:31,328 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:31,335 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,335 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:31,335 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:31,335 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82077737] [2021-06-16 15:50:31,336 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82077737] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:31,336 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:31,336 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-06-16 15:50:31,336 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99577684] [2021-06-16 15:50:31,336 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-06-16 15:50:31,336 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:31,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-06-16 15:50:31,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-06-16 15:50:31,337 INFO L87 Difference]: Start difference. First operand 2386 states and 5247 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-06-16 15:50:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:31,429 INFO L93 Difference]: Finished difference Result 1962 states and 3892 transitions. [2021-06-16 15:50:31,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-06-16 15:50:31,429 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-06-16 15:50:31,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:31,432 INFO L225 Difference]: With dead ends: 1962 [2021-06-16 15:50:31,432 INFO L226 Difference]: Without dead ends: 1255 [2021-06-16 15:50:31,432 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 76.3ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-06-16 15:50:31,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2021-06-16 15:50:31,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1255. [2021-06-16 15:50:31,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 1225 states have (on average 2.085714285714286) internal successors, (2555), 1254 states have internal predecessors, (2555), 0 states have call successors, (0), 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-06-16 15:50:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 2555 transitions. [2021-06-16 15:50:31,449 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 2555 transitions. Word has length 74 [2021-06-16 15:50:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:31,449 INFO L482 AbstractCegarLoop]: Abstraction has 1255 states and 2555 transitions. [2021-06-16 15:50:31,449 INFO L483 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-06-16 15:50:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 2555 transitions. [2021-06-16 15:50:31,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2021-06-16 15:50:31,451 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:31,451 INFO L472 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-06-16 15:50:31,451 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-06-16 15:50:31,451 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:31,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash 1387276915, now seen corresponding path program 1 times [2021-06-16 15:50:31,452 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:31,452 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173520040] [2021-06-16 15:50:31,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:31,489 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,489 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,502 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,503 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,506 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,507 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,510 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,511 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,515 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-06-16 15:50:31,515 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-06-16 15:50:31,527 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,528 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:31,536 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-06-16 15:50:31,536 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:31,547 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,548 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,548 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:31,548 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:31,548 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173520040] [2021-06-16 15:50:31,548 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173520040] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:31,548 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:31,549 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-06-16 15:50:31,549 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597151854] [2021-06-16 15:50:31,549 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-06-16 15:50:31,549 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:31,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-06-16 15:50:31,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-06-16 15:50:31,549 INFO L87 Difference]: Start difference. First operand 1255 states and 2555 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-06-16 15:50:31,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:31,658 INFO L93 Difference]: Finished difference Result 721 states and 1226 transitions. [2021-06-16 15:50:31,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-06-16 15:50:31,658 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-06-16 15:50:31,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:31,659 INFO L225 Difference]: With dead ends: 721 [2021-06-16 15:50:31,659 INFO L226 Difference]: Without dead ends: 291 [2021-06-16 15:50:31,659 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 96.2ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-06-16 15:50:31,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2021-06-16 15:50:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2021-06-16 15:50:31,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 282 states have (on average 1.6914893617021276) internal successors, (477), 290 states have internal predecessors, (477), 0 states have call successors, (0), 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-06-16 15:50:31,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 477 transitions. [2021-06-16 15:50:31,663 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 477 transitions. Word has length 76 [2021-06-16 15:50:31,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:31,663 INFO L482 AbstractCegarLoop]: Abstraction has 291 states and 477 transitions. [2021-06-16 15:50:31,663 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 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-06-16 15:50:31,663 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 477 transitions. [2021-06-16 15:50:31,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-16 15:50:31,664 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:31,664 INFO L472 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-06-16 15:50:31,664 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-06-16 15:50:31,664 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:31,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:31,664 INFO L82 PathProgramCache]: Analyzing trace with hash -243396287, now seen corresponding path program 1 times [2021-06-16 15:50:31,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:31,664 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988263194] [2021-06-16 15:50:31,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:31,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-06-16 15:50:31,718 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,719 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,719 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-06-16 15:50:31,722 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,722 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-06-16 15:50:31,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,727 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 13 [2021-06-16 15:50:31,734 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,734 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 16 [2021-06-16 15:50:31,743 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,744 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-06-16 15:50:31,752 INFO L142 QuantifierPusher]: treesize reduction 6, result has 91.0 percent of original size [2021-06-16 15:50:31,753 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 61 [2021-06-16 15:50:31,777 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-06-16 15:50:31,777 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-06-16 15:50:31,790 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,790 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:31,799 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,799 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-06-16 15:50:31,807 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-06-16 15:50:31,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-06-16 15:50:31,808 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-06-16 15:50:31,808 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-06-16 15:50:31,808 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988263194] [2021-06-16 15:50:31,808 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988263194] provided 1 perfect and 0 imperfect interpolant sequences [2021-06-16 15:50:31,808 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-06-16 15:50:31,808 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-06-16 15:50:31,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446489213] [2021-06-16 15:50:31,809 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-06-16 15:50:31,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-06-16 15:50:31,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-06-16 15:50:31,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-06-16 15:50:31,809 INFO L87 Difference]: Start difference. First operand 291 states and 477 transitions. Second operand has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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-06-16 15:50:31,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-06-16 15:50:31,923 INFO L93 Difference]: Finished difference Result 425 states and 754 transitions. [2021-06-16 15:50:31,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-06-16 15:50:31,923 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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 81 [2021-06-16 15:50:31,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-06-16 15:50:31,924 INFO L225 Difference]: With dead ends: 425 [2021-06-16 15:50:31,924 INFO L226 Difference]: Without dead ends: 308 [2021-06-16 15:50:31,924 INFO L728 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 116.2ms TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2021-06-16 15:50:31,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2021-06-16 15:50:31,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 288. [2021-06-16 15:50:31,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 279 states have (on average 1.6881720430107527) internal successors, (471), 287 states have internal predecessors, (471), 0 states have call successors, (0), 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-06-16 15:50:31,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 471 transitions. [2021-06-16 15:50:31,928 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 471 transitions. Word has length 81 [2021-06-16 15:50:31,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-06-16 15:50:31,928 INFO L482 AbstractCegarLoop]: Abstraction has 288 states and 471 transitions. [2021-06-16 15:50:31,928 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 7.363636363636363) internal successors, (81), 11 states have internal predecessors, (81), 0 states have call successors, (0), 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-06-16 15:50:31,928 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 471 transitions. [2021-06-16 15:50:31,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2021-06-16 15:50:31,929 INFO L464 BasicCegarLoop]: Found error trace [2021-06-16 15:50:31,929 INFO L472 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-06-16 15:50:31,929 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-06-16 15:50:31,929 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-06-16 15:50:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-06-16 15:50:31,930 INFO L82 PathProgramCache]: Analyzing trace with hash 161878031, now seen corresponding path program 2 times [2021-06-16 15:50:31,930 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-06-16 15:50:31,930 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536235597] [2021-06-16 15:50:31,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-06-16 15:50:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:50:31,955 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:50:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-06-16 15:50:31,993 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-06-16 15:50:32,034 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-06-16 15:50:32,034 INFO L573 BasicCegarLoop]: Counterexample might be feasible [2021-06-16 15:50:32,035 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-06-16 15:50:32,035 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (3/3) [2021-06-16 15:50:32,036 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-06-16 15:50:32,139 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.06 03:50:32 BasicIcfg [2021-06-16 15:50:32,139 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-06-16 15:50:32,140 INFO L168 Benchmark]: Toolchain (without parser) took 9854.99 ms. Allocated memory was 247.5 MB in the beginning and 1.1 GB in the end (delta: 846.2 MB). Free memory was 210.7 MB in the beginning and 717.1 MB in the end (delta: -506.3 MB). Peak memory consumption was 339.7 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:32,140 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 247.5 MB. Free memory is still 228.9 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-06-16 15:50:32,140 INFO L168 Benchmark]: CACSL2BoogieTranslator took 458.48 ms. Allocated memory is still 247.5 MB. Free memory was 210.6 MB in the beginning and 206.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:32,143 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.39 ms. Allocated memory is still 247.5 MB. Free memory was 205.8 MB in the beginning and 203.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:32,145 INFO L168 Benchmark]: Boogie Preprocessor took 29.55 ms. Allocated memory is still 247.5 MB. Free memory was 202.7 MB in the beginning and 200.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:32,146 INFO L168 Benchmark]: RCFGBuilder took 1435.20 ms. Allocated memory was 247.5 MB in the beginning and 348.1 MB in the end (delta: 100.7 MB). Free memory was 200.6 MB in the beginning and 292.5 MB in the end (delta: -91.9 MB). Peak memory consumption was 117.1 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:32,146 INFO L168 Benchmark]: TraceAbstraction took 7849.51 ms. Allocated memory was 348.1 MB in the beginning and 1.1 GB in the end (delta: 745.5 MB). Free memory was 291.9 MB in the beginning and 717.1 MB in the end (delta: -425.1 MB). Peak memory consumption was 320.4 MB. Max. memory is 8.0 GB. [2021-06-16 15:50:32,146 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.44 ms. Allocated memory is still 247.5 MB. Free memory is still 228.9 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 458.48 ms. Allocated memory is still 247.5 MB. Free memory was 210.6 MB in the beginning and 206.3 MB in the end (delta: 4.3 MB). Peak memory consumption was 13.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 75.39 ms. Allocated memory is still 247.5 MB. Free memory was 205.8 MB in the beginning and 203.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 29.55 ms. Allocated memory is still 247.5 MB. Free memory was 202.7 MB in the beginning and 200.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1435.20 ms. Allocated memory was 247.5 MB in the beginning and 348.1 MB in the end (delta: 100.7 MB). Free memory was 200.6 MB in the beginning and 292.5 MB in the end (delta: -91.9 MB). Peak memory consumption was 117.1 MB. Max. memory is 8.0 GB. * TraceAbstraction took 7849.51 ms. Allocated memory was 348.1 MB in the beginning and 1.1 GB in the end (delta: 745.5 MB). Free memory was 291.9 MB in the beginning and 717.1 MB in the end (delta: -425.1 MB). Peak memory consumption was 320.4 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: 56371, positive: 52180, positive conditional: 52180, positive unconditional: 0, negative: 4191, negative conditional: 4191, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54043, positive: 52180, positive conditional: 0, positive unconditional: 52180, negative: 1863, negative conditional: 0, negative unconditional: 1863, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1063, positive: 1033, positive conditional: 0, positive unconditional: 1033, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1063, positive: 1029, positive conditional: 0, positive unconditional: 1029, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 295, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 291, negative conditional: 0, negative unconditional: 291, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54043, positive: 51147, positive conditional: 0, positive unconditional: 51147, negative: 1833, negative conditional: 0, negative unconditional: 1833, unknown: 1063, unknown conditional: 0, unknown unconditional: 1063] , Statistics on independence cache: Total cache size (in pairs): 1063, Positive cache size: 1033, Positive conditional cache size: 0, Positive unconditional cache size: 1033, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 2328 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 56371, positive: 52180, positive conditional: 52180, positive unconditional: 0, negative: 4191, negative conditional: 4191, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54043, positive: 52180, positive conditional: 0, positive unconditional: 52180, negative: 1863, negative conditional: 0, negative unconditional: 1863, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1063, positive: 1033, positive conditional: 0, positive unconditional: 1033, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1063, positive: 1029, positive conditional: 0, positive unconditional: 1029, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 266, positive: 5, positive conditional: 0, positive unconditional: 5, negative: 262, negative conditional: 0, negative unconditional: 262, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54043, positive: 51147, positive conditional: 0, positive unconditional: 51147, negative: 1833, negative conditional: 0, negative unconditional: 1833, unknown: 1063, unknown conditional: 0, unknown unconditional: 1063] , Statistics on independence cache: Total cache size (in pairs): 1063, Positive cache size: 1033, Positive conditional cache size: 0, Positive unconditional cache size: 1033, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 2328 - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 56371, positive: 52180, positive conditional: 52180, positive unconditional: 0, negative: 4191, negative conditional: 4191, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 54043, positive: 52180, positive conditional: 0, positive unconditional: 52180, negative: 1863, negative conditional: 0, negative unconditional: 1863, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1063, positive: 1033, positive conditional: 0, positive unconditional: 1033, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1063, positive: 1029, positive conditional: 0, positive unconditional: 1029, negative: 34, negative conditional: 0, negative unconditional: 34, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 34, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 30, negative conditional: 0, negative unconditional: 30, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 286, positive: 4, positive conditional: 0, positive unconditional: 4, negative: 283, negative conditional: 0, negative unconditional: 283, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 54043, positive: 51147, positive conditional: 0, positive unconditional: 51147, negative: 1833, negative conditional: 0, negative unconditional: 1833, unknown: 1063, unknown conditional: 0, unknown unconditional: 1063] , Statistics on independence cache: Total cache size (in pairs): 1063, Positive cache size: 1033, Positive conditional cache size: 0, Positive unconditional cache size: 1033, Negative cache size: 30, Negative conditional cache size: 0, Negative unconditional cache size: 30, Independence queries for same thread: 2328 - PositiveResult [Line: 18]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - 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_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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_p0_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] [L815] 0 pthread_t t2528; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L816] FCALL, FORK 0 pthread_create(&t2528, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L817] 0 pthread_t t2529; VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L818] FCALL, FORK 0 pthread_create(&t2529, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L819] 0 pthread_t t2530; VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L820] FCALL, FORK 0 pthread_create(&t2530, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L778] 3 y$w_buff1 = y$w_buff0 [L779] 3 y$w_buff0 = 2 [L780] 3 y$w_buff1_used = y$w_buff0_used [L781] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L783] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L784] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L785] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L786] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L787] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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] [L741] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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=2] [L746] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_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=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=2] [L751] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=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=2] [L758] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=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=2] [L761] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_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=1, 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=2] [L793] 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) [L793] 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) [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L794] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L795] 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 [L796] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L796] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L797] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L797] 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 [L764] 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) [L764] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L764] 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) [L764] 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) [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L765] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L766] 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 [L767] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L767] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L768] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L768] 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 [L771] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_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=1, 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=2] [L800] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L822] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p0_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=1, 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=2] [L826] 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) [L826] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L826] 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) [L826] 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) [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L827] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L828] 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 [L829] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L829] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L830] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L830] 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 [L833] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 0 y$flush_delayed = weak$$choice2 [L836] 0 y$mem_tmp = y [L837] 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) [L837] 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) [L838] 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)) [L838] 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)) [L839] 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)) [L839] 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)) [L840] 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)) [L840] 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)) [L841] 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)) [L841] 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)) [L842] 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)) [L842] 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)) [L843] 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)) [L843] 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)) [L844] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) [L845] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L845] 0 y = y$flush_delayed ? y$mem_tmp : y [L846] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p0_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=255, x=1, 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=2] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p0_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=255, x=1, 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=2] [L18] 0 reach_error() VAL [__unbuffered_cnt=3, __unbuffered_p0_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=255, x=1, 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=2] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2Thread1of1ForFork0 with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1660.6ms, OverallIterations: 1, TraceHistogramMax: 1, EmptinessCheckTime: 38.8ms, AutomataDifference: 172.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1163.8ms, PartialOrderReductionTime: 1151.4ms, HoareTripleCheckerStatistics: 94 SDtfs, 35 SDslu, 61 SDs, 0 SdLazy, 9 SolverSat, 3 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.0ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14088occurred in iteration=0, InterpolantAutomatonStates: 3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 6.0ms AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 4.7ms SsaConstructionTime, 31.4ms SatisfiabilityAnalysisTime, 163.0ms InterpolantComputationTime, 55 NumberOfCodeBlocks, 55 NumberOfCodeBlocksAsserted, 1 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 110 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: P2 with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1005.8ms, OverallIterations: 0, TraceHistogramMax: 0, EmptinessCheckTime: 65.3ms, AutomataDifference: 0.0ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 939.8ms, PartialOrderReductionTime: 938.2ms, HoareTripleCheckerStatistics: No data available, PredicateUnifierStatistics: No data available, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14088occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 7 procedures, 131 locations, 6 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 4977.9ms, OverallIterations: 12, TraceHistogramMax: 1, EmptinessCheckTime: 59.6ms, AutomataDifference: 1784.9ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 894.4ms, PartialOrderReductionTime: 893.0ms, HoareTripleCheckerStatistics: 1303 SDtfs, 2057 SDslu, 4265 SDs, 0 SdLazy, 578 SolverSat, 132 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 505.1ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1081.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=14088occurred in iteration=0, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 766.1ms AutomataMinimizationTime, 11 MinimizatonAttempts, 595 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 33.6ms SsaConstructionTime, 328.7ms SatisfiabilityAnalysisTime, 939.3ms InterpolantComputationTime, 875 NumberOfCodeBlocks, 875 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 783 ConstructedInterpolants, 0 QuantifiedInterpolants, 3299 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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! Received shutdown request...