/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/mix046_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.1-9e34d99ae2c6837f487980c721c4b6acf9d9b15c-9e34d99 [2021-07-09 22:05:24,641 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 22:05:24,644 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 22:05:24,684 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 22:05:24,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 22:05:24,688 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 22:05:24,690 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 22:05:24,695 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 22:05:24,697 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 22:05:24,702 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 22:05:24,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 22:05:24,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 22:05:24,704 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 22:05:24,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 22:05:24,708 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 22:05:24,709 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 22:05:24,712 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 22:05:24,713 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 22:05:24,715 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 22:05:24,720 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 22:05:24,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 22:05:24,723 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 22:05:24,724 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 22:05:24,725 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 22:05:24,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 22:05:24,732 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 22:05:24,732 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 22:05:24,734 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 22:05:24,734 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 22:05:24,735 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 22:05:24,735 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 22:05:24,736 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 22:05:24,737 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 22:05:24,738 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 22:05:24,740 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 22:05:24,740 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 22:05:24,741 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 22:05:24,741 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 22:05:24,741 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 22:05:24,742 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 22:05:24,743 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 22:05:24,744 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-07-09 22:05:24,790 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 22:05:24,790 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 22:05:24,793 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 22:05:24,793 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 22:05:24,794 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 22:05:24,794 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 22:05:24,794 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 22:05:24,794 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 22:05:24,794 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 22:05:24,795 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 22:05:24,795 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 22:05:24,796 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 22:05:24,796 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 22:05:24,796 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 22:05:24,796 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 22:05:24,796 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 22:05:24,796 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 22:05:24,797 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 22:05:24,797 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 22:05:24,797 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 22:05:24,797 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 22:05:24,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 22:05:24,798 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 22:05:24,798 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 22:05:24,798 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 22:05:24,798 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 22:05:24,798 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 22:05:24,799 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 22:05:24,799 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 22:05:24,799 INFO L138 SettingsManager]: * Partial Order Reduction in concurrent analysis=SLEEP_DELAY_SET [2021-07-09 22:05:24,799 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-07-09 22:05:25,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 22:05:25,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 22:05:25,195 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 22:05:25,196 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 22:05:25,196 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 22:05:25,197 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-07-09 22:05:25,273 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315ccf490/8a84ba797c604015bebafa88fd0a01c8/FLAG897fa34a0 [2021-07-09 22:05:25,762 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 22:05:25,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-07-09 22:05:25,781 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315ccf490/8a84ba797c604015bebafa88fd0a01c8/FLAG897fa34a0 [2021-07-09 22:05:26,089 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/315ccf490/8a84ba797c604015bebafa88fd0a01c8 [2021-07-09 22:05:26,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 22:05:26,092 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 22:05:26,109 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 22:05:26,109 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 22:05:26,113 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 22:05:26,113 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,114 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@565fbfb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26, skipping insertion in model container [2021-07-09 22:05:26,115 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,121 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 22:05:26,178 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 22:05:26,332 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/mix046_power.opt.i[950,963] [2021-07-09 22:05:26,576 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:05:26,584 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 22:05:26,598 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/mix046_power.opt.i[950,963] [2021-07-09 22:05:26,655 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 22:05:26,699 INFO L208 MainTranslator]: Completed translation [2021-07-09 22:05:26,700 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26 WrapperNode [2021-07-09 22:05:26,701 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 22:05:26,702 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 22:05:26,703 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 22:05:26,703 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 22:05:26,709 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,753 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,797 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 22:05:26,797 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 22:05:26,798 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 22:05:26,798 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 22:05:26,808 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,809 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,820 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,820 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,831 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,834 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,847 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (1/1) ... [2021-07-09 22:05:26,851 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 22:05:26,852 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 22:05:26,852 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 22:05:26,852 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 22:05:26,853 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (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-07-09 22:05:26,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 22:05:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 22:05:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 22:05:26,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 22:05:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 22:05:26,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 22:05:26,937 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 22:05:26,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 22:05:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 22:05:26,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 22:05:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-07-09 22:05:26,938 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-07-09 22:05:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 22:05:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 22:05:26,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 22:05:26,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 22:05:26,940 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2021-07-09 22:05:28,745 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 22:05:28,746 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 22:05:28,748 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:05:28 BoogieIcfgContainer [2021-07-09 22:05:28,748 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 22:05:28,750 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 22:05:28,750 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 22:05:28,752 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 22:05:28,753 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 10:05:26" (1/3) ... [2021-07-09 22:05:28,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721f9c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:05:28, skipping insertion in model container [2021-07-09 22:05:28,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 10:05:26" (2/3) ... [2021-07-09 22:05:28,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@721f9c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 10:05:28, skipping insertion in model container [2021-07-09 22:05:28,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 10:05:28" (3/3) ... [2021-07-09 22:05:28,756 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2021-07-09 22:05:28,762 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 22:05:28,762 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 22:05:28,762 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 22:05:28,763 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 22:05:28,802 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,803 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,803 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,803 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,803 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,804 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,804 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,805 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,806 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,807 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,808 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,808 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,808 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,809 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,809 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,809 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,810 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,810 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,811 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,812 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,813 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,813 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,814 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,815 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,815 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,815 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,816 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,816 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,817 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,818 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,819 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,820 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,823 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,823 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,824 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,825 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,825 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,827 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,828 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,830 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,831 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,833 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,833 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,838 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,838 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,839 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,840 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,841 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,842 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,842 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 22:05:28,843 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 22:05:28,866 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-07-09 22:05:28,892 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 22:05:28,893 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 22:05:28,893 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 22:05:28,893 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 22:05:28,893 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 22:05:28,893 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 22:05:28,893 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 22:05:28,893 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 22:05:34,156 INFO L276 IsEmpty]: Start isEmpty. Operand has 72173 states, 63918 states have (on average 2.203573328326919) internal successors, (140848), 72172 states have internal predecessors, (140848), 0 states have call successors, (0), 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-07-09 22:05:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-09 22:05:34,243 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:34,244 INFO L508 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] [2021-07-09 22:05:34,245 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:34,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:34,250 INFO L82 PathProgramCache]: Analyzing trace with hash -317353279, now seen corresponding path program 1 times [2021-07-09 22:05:34,257 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:34,258 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597375498] [2021-07-09 22:05:34,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:34,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:34,725 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:34,726 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:34,727 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:34,728 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:34,743 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:34,748 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:34,770 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:34,774 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:34,784 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:34,785 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:34,794 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:34,795 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:34,798 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:34,799 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597375498] [2021-07-09 22:05:34,799 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597375498] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:34,800 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:34,800 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:05:34,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651771536] [2021-07-09 22:05:34,803 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:05:34,804 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:34,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:05:34,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:05:34,966 INFO L87 Difference]: Start difference. First operand has 72173 states, 63918 states have (on average 2.203573328326919) internal successors, (140848), 72172 states have internal predecessors, (140848), 0 states have call successors, (0), 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 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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-07-09 22:05:36,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:36,328 INFO L93 Difference]: Finished difference Result 77661 states and 154916 transitions. [2021-07-09 22:05:36,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:05:36,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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 80 [2021-07-09 22:05:36,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:36,583 INFO L225 Difference]: With dead ends: 77661 [2021-07-09 22:05:36,583 INFO L226 Difference]: Without dead ends: 32212 [2021-07-09 22:05:36,585 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 114.3ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:05:37,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32212 states. [2021-07-09 22:05:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32212 to 32212. [2021-07-09 22:05:38,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32212 states, 31820 states have (on average 2.3122878692646136) internal successors, (73577), 32211 states have internal predecessors, (73577), 0 states have call successors, (0), 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-07-09 22:05:38,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32212 states to 32212 states and 73577 transitions. [2021-07-09 22:05:38,511 INFO L78 Accepts]: Start accepts. Automaton has 32212 states and 73577 transitions. Word has length 80 [2021-07-09 22:05:38,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:38,513 INFO L482 AbstractCegarLoop]: Abstraction has 32212 states and 73577 transitions. [2021-07-09 22:05:38,513 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 6 states have internal predecessors, (80), 0 states have call successors, (0), 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-07-09 22:05:38,514 INFO L276 IsEmpty]: Start isEmpty. Operand 32212 states and 73577 transitions. [2021-07-09 22:05:38,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2021-07-09 22:05:38,758 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:38,758 INFO L508 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, 1, 1, 1] [2021-07-09 22:05:38,759 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 22:05:38,759 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:38,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:38,760 INFO L82 PathProgramCache]: Analyzing trace with hash -51714524, now seen corresponding path program 1 times [2021-07-09 22:05:38,760 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:38,760 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939267118] [2021-07-09 22:05:38,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:38,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:38,957 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:38,958 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:38,958 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:38,959 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:38,963 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:38,963 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:38,979 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:38,980 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:38,993 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:38,994 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:39,003 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:39,003 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:39,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:39,005 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:39,005 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939267118] [2021-07-09 22:05:39,005 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939267118] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:39,005 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:39,005 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:05:39,006 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350072406] [2021-07-09 22:05:39,007 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:05:39,007 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:39,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:05:39,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:05:39,009 INFO L87 Difference]: Start difference. First operand 32212 states and 73577 transitions. Second operand has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-07-09 22:05:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:39,351 INFO L93 Difference]: Finished difference Result 37392 states and 92209 transitions. [2021-07-09 22:05:39,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:05:39,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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 84 [2021-07-09 22:05:39,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:39,466 INFO L225 Difference]: With dead ends: 37392 [2021-07-09 22:05:39,466 INFO L226 Difference]: Without dead ends: 29902 [2021-07-09 22:05:39,467 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 104.8ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:05:40,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29902 states. [2021-07-09 22:05:40,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29902 to 29902. [2021-07-09 22:05:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29902 states, 29552 states have (on average 2.314597996751489) internal successors, (68401), 29901 states have internal predecessors, (68401), 0 states have call successors, (0), 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-07-09 22:05:41,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29902 states to 29902 states and 68401 transitions. [2021-07-09 22:05:41,012 INFO L78 Accepts]: Start accepts. Automaton has 29902 states and 68401 transitions. Word has length 84 [2021-07-09 22:05:41,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:41,014 INFO L482 AbstractCegarLoop]: Abstraction has 29902 states and 68401 transitions. [2021-07-09 22:05:41,014 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.0) internal successors, (84), 6 states have internal predecessors, (84), 0 states have call successors, (0), 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-07-09 22:05:41,016 INFO L276 IsEmpty]: Start isEmpty. Operand 29902 states and 68401 transitions. [2021-07-09 22:05:41,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-09 22:05:41,056 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:41,056 INFO L508 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, 1, 1, 1, 1, 1] [2021-07-09 22:05:41,056 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 22:05:41,057 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:41,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:41,057 INFO L82 PathProgramCache]: Analyzing trace with hash -784098075, now seen corresponding path program 1 times [2021-07-09 22:05:41,057 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:41,058 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361090672] [2021-07-09 22:05:41,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:41,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:41,166 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,167 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:41,167 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,168 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:41,171 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,172 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:41,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:05:41,198 INFO L142 QuantifierPusher]: treesize reduction 37, result has 41.3 percent of original size [2021-07-09 22:05:41,199 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-09 22:05:41,212 INFO L142 QuantifierPusher]: treesize reduction 27, result has 69.0 percent of original size [2021-07-09 22:05:41,214 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:05:41,254 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:41,254 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:41,273 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,274 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:41,284 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,285 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:41,296 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:41,297 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:41,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:41,298 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:41,298 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361090672] [2021-07-09 22:05:41,298 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361090672] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:41,298 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:41,299 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 22:05:41,299 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783886029] [2021-07-09 22:05:41,299 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 22:05:41,299 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:41,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 22:05:41,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2021-07-09 22:05:41,300 INFO L87 Difference]: Start difference. First operand 29902 states and 68401 transitions. Second operand has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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-07-09 22:05:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:41,953 INFO L93 Difference]: Finished difference Result 34242 states and 83309 transitions. [2021-07-09 22:05:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 22:05:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2021-07-09 22:05:41,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:42,026 INFO L225 Difference]: With dead ends: 34242 [2021-07-09 22:05:42,026 INFO L226 Difference]: Without dead ends: 28642 [2021-07-09 22:05:42,027 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 292.5ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-07-09 22:05:42,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28642 states. [2021-07-09 22:05:42,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28642 to 28642. [2021-07-09 22:05:42,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28642 states, 28292 states have (on average 2.235932419058391) internal successors, (63259), 28641 states have internal predecessors, (63259), 0 states have call successors, (0), 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-07-09 22:05:43,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28642 states to 28642 states and 63259 transitions. [2021-07-09 22:05:43,062 INFO L78 Accepts]: Start accepts. Automaton has 28642 states and 63259 transitions. Word has length 86 [2021-07-09 22:05:43,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:43,062 INFO L482 AbstractCegarLoop]: Abstraction has 28642 states and 63259 transitions. [2021-07-09 22:05:43,062 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 9.555555555555555) internal successors, (86), 9 states have internal predecessors, (86), 0 states have call successors, (0), 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-07-09 22:05:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 28642 states and 63259 transitions. [2021-07-09 22:05:43,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-09 22:05:43,104 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:43,104 INFO L508 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, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:43,104 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 22:05:43,104 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:43,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:43,105 INFO L82 PathProgramCache]: Analyzing trace with hash 527306021, now seen corresponding path program 1 times [2021-07-09 22:05:43,105 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:43,105 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982795643] [2021-07-09 22:05:43,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:43,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:43,236 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:43,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:43,237 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:43,237 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:43,242 INFO L142 QuantifierPusher]: treesize reduction 37, result has 38.3 percent of original size [2021-07-09 22:05:43,242 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:05:43,247 INFO L142 QuantifierPusher]: treesize reduction 37, result has 41.3 percent of original size [2021-07-09 22:05:43,248 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 26 [2021-07-09 22:05:43,574 WARN L205 SmtUtils]: Spent 323.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 11 [2021-07-09 22:05:43,582 INFO L142 QuantifierPusher]: treesize reduction 27, result has 69.0 percent of original size [2021-07-09 22:05:43,584 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 60 [2021-07-09 22:05:43,641 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:43,642 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:43,664 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:43,665 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:43,678 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:43,679 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:43,692 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:43,692 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:43,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:43,693 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:43,693 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982795643] [2021-07-09 22:05:43,693 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982795643] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:43,693 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:43,694 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 22:05:43,694 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056780015] [2021-07-09 22:05:43,694 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 22:05:43,694 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:43,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 22:05:43,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-07-09 22:05:43,695 INFO L87 Difference]: Start difference. First operand 28642 states and 63259 transitions. Second operand has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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-07-09 22:05:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:44,248 INFO L93 Difference]: Finished difference Result 34520 states and 82123 transitions. [2021-07-09 22:05:44,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 22:05:44,249 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-09 22:05:44,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:44,338 INFO L225 Difference]: With dead ends: 34520 [2021-07-09 22:05:44,338 INFO L226 Difference]: Without dead ends: 30600 [2021-07-09 22:05:44,338 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 621.7ms TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-07-09 22:05:44,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30600 states. [2021-07-09 22:05:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30600 to 29012. [2021-07-09 22:05:45,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29012 states, 28662 states have (on average 2.2347358872374574) internal successors, (64052), 29011 states have internal predecessors, (64052), 0 states have call successors, (0), 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-07-09 22:05:45,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29012 states to 29012 states and 64052 transitions. [2021-07-09 22:05:45,629 INFO L78 Accepts]: Start accepts. Automaton has 29012 states and 64052 transitions. Word has length 87 [2021-07-09 22:05:45,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:45,630 INFO L482 AbstractCegarLoop]: Abstraction has 29012 states and 64052 transitions. [2021-07-09 22:05:45,630 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 10.875) internal successors, (87), 8 states have internal predecessors, (87), 0 states have call successors, (0), 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-07-09 22:05:45,630 INFO L276 IsEmpty]: Start isEmpty. Operand 29012 states and 64052 transitions. [2021-07-09 22:05:45,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-09 22:05:45,847 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:45,847 INFO L508 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, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:45,847 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 22:05:45,848 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:45,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:45,848 INFO L82 PathProgramCache]: Analyzing trace with hash -493263839, now seen corresponding path program 2 times [2021-07-09 22:05:45,848 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:45,848 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500835244] [2021-07-09 22:05:45,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:45,930 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:45,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:45,931 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:45,933 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:45,937 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:45,937 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:45,948 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-07-09 22:05:45,952 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-09 22:05:45,978 INFO L142 QuantifierPusher]: treesize reduction 52, result has 51.4 percent of original size [2021-07-09 22:05:45,979 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 55 [2021-07-09 22:05:46,006 INFO L142 QuantifierPusher]: treesize reduction 52, result has 52.7 percent of original size [2021-07-09 22:05:46,007 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 58 [2021-07-09 22:05:46,042 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:46,042 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:46,063 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:46,064 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:46,075 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:46,075 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:46,088 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:46,088 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:46,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:46,089 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:46,089 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500835244] [2021-07-09 22:05:46,090 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500835244] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:46,090 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:46,090 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 22:05:46,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988120512] [2021-07-09 22:05:46,092 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 22:05:46,095 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:46,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 22:05:46,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2021-07-09 22:05:46,097 INFO L87 Difference]: Start difference. First operand 29012 states and 64052 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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-07-09 22:05:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:46,769 INFO L93 Difference]: Finished difference Result 41164 states and 96215 transitions. [2021-07-09 22:05:46,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 22:05:46,770 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2021-07-09 22:05:46,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:47,019 INFO L225 Difference]: With dead ends: 41164 [2021-07-09 22:05:47,020 INFO L226 Difference]: Without dead ends: 35284 [2021-07-09 22:05:47,022 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 416.7ms TimeCoverageRelationStatistics Valid=107, Invalid=273, Unknown=0, NotChecked=0, Total=380 [2021-07-09 22:05:47,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35284 states. [2021-07-09 22:05:47,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35284 to 33306. [2021-07-09 22:05:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33306 states, 32956 states have (on average 2.135605049156451) internal successors, (70381), 33305 states have internal predecessors, (70381), 0 states have call successors, (0), 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-07-09 22:05:48,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33306 states to 33306 states and 70381 transitions. [2021-07-09 22:05:48,130 INFO L78 Accepts]: Start accepts. Automaton has 33306 states and 70381 transitions. Word has length 87 [2021-07-09 22:05:48,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:48,131 INFO L482 AbstractCegarLoop]: Abstraction has 33306 states and 70381 transitions. [2021-07-09 22:05:48,131 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 0 states have call successors, (0), 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-07-09 22:05:48,131 INFO L276 IsEmpty]: Start isEmpty. Operand 33306 states and 70381 transitions. [2021-07-09 22:05:48,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 22:05:48,175 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:48,175 INFO L508 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:48,175 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 22:05:48,175 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:48,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:48,176 INFO L82 PathProgramCache]: Analyzing trace with hash -301896990, now seen corresponding path program 1 times [2021-07-09 22:05:48,176 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:48,176 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607622160] [2021-07-09 22:05:48,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:48,282 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,283 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:48,283 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,284 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:48,287 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,288 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:48,294 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,295 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:05:48,306 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.0 percent of original size [2021-07-09 22:05:48,309 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 63 [2021-07-09 22:05:48,322 INFO L142 QuantifierPusher]: treesize reduction 21, result has 75.9 percent of original size [2021-07-09 22:05:48,326 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 66 [2021-07-09 22:05:48,370 INFO L142 QuantifierPusher]: treesize reduction 21, result has 76.7 percent of original size [2021-07-09 22:05:48,371 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 69 [2021-07-09 22:05:48,416 INFO L142 QuantifierPusher]: treesize reduction 47, result has 64.1 percent of original size [2021-07-09 22:05:48,417 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 84 [2021-07-09 22:05:48,460 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:48,461 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:48,479 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,479 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:48,496 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,497 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:48,508 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:48,509 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:48,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:48,509 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:48,509 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607622160] [2021-07-09 22:05:48,510 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607622160] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:48,510 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:48,510 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2021-07-09 22:05:48,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054985078] [2021-07-09 22:05:48,511 INFO L462 AbstractCegarLoop]: Interpolant automaton has 11 states [2021-07-09 22:05:48,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:48,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2021-07-09 22:05:48,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:05:48,512 INFO L87 Difference]: Start difference. First operand 33306 states and 70381 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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-07-09 22:05:49,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:49,370 INFO L93 Difference]: Finished difference Result 38874 states and 86236 transitions. [2021-07-09 22:05:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 22:05:49,371 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-07-09 22:05:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:49,474 INFO L225 Difference]: With dead ends: 38874 [2021-07-09 22:05:49,474 INFO L226 Difference]: Without dead ends: 35738 [2021-07-09 22:05:49,474 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 373.6ms TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2021-07-09 22:05:49,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35738 states. [2021-07-09 22:05:50,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35738 to 30223. [2021-07-09 22:05:50,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30223 states, 29873 states have (on average 2.1911090282194623) internal successors, (65455), 30222 states have internal predecessors, (65455), 0 states have call successors, (0), 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-07-09 22:05:50,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30223 states to 30223 states and 65455 transitions. [2021-07-09 22:05:50,456 INFO L78 Accepts]: Start accepts. Automaton has 30223 states and 65455 transitions. Word has length 88 [2021-07-09 22:05:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:50,456 INFO L482 AbstractCegarLoop]: Abstraction has 30223 states and 65455 transitions. [2021-07-09 22:05:50,456 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 11 states have internal predecessors, (88), 0 states have call successors, (0), 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-07-09 22:05:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 30223 states and 65455 transitions. [2021-07-09 22:05:50,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 22:05:50,503 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:50,503 INFO L508 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:50,503 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 22:05:50,503 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:50,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:50,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1874791578, now seen corresponding path program 2 times [2021-07-09 22:05:50,504 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:50,505 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1569461648] [2021-07-09 22:05:50,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:50,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:50,652 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,652 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:50,653 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,653 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:50,656 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,657 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:50,662 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,663 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 10 [2021-07-09 22:05:50,674 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-07-09 22:05:50,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-09 22:05:50,703 INFO L142 QuantifierPusher]: treesize reduction 26, result has 58.7 percent of original size [2021-07-09 22:05:50,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 37 [2021-07-09 22:05:50,730 INFO L142 QuantifierPusher]: treesize reduction 26, result has 60.6 percent of original size [2021-07-09 22:05:50,732 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 40 [2021-07-09 22:05:50,762 INFO L142 QuantifierPusher]: treesize reduction 26, result has 56.7 percent of original size [2021-07-09 22:05:50,762 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 34 [2021-07-09 22:05:50,786 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:50,786 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:50,806 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,807 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:50,819 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,822 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:50,835 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:50,836 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:50,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:50,836 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:50,836 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1569461648] [2021-07-09 22:05:50,837 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1569461648] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:50,837 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:50,837 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 22:05:50,837 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768692245] [2021-07-09 22:05:50,837 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 22:05:50,837 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:50,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 22:05:50,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2021-07-09 22:05:50,838 INFO L87 Difference]: Start difference. First operand 30223 states and 65455 transitions. Second operand has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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-07-09 22:05:51,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:51,571 INFO L93 Difference]: Finished difference Result 40659 states and 95425 transitions. [2021-07-09 22:05:51,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:05:51,572 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-07-09 22:05:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:51,683 INFO L225 Difference]: With dead ends: 40659 [2021-07-09 22:05:51,684 INFO L226 Difference]: Without dead ends: 37033 [2021-07-09 22:05:51,684 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 330.1ms TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2021-07-09 22:05:51,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37033 states. [2021-07-09 22:05:52,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37033 to 30223. [2021-07-09 22:05:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30223 states, 29873 states have (on average 2.187828473872728) internal successors, (65357), 30222 states have internal predecessors, (65357), 0 states have call successors, (0), 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-07-09 22:05:52,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30223 states to 30223 states and 65357 transitions. [2021-07-09 22:05:52,757 INFO L78 Accepts]: Start accepts. Automaton has 30223 states and 65357 transitions. Word has length 88 [2021-07-09 22:05:52,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:52,757 INFO L482 AbstractCegarLoop]: Abstraction has 30223 states and 65357 transitions. [2021-07-09 22:05:52,757 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.333333333333333) internal successors, (88), 12 states have internal predecessors, (88), 0 states have call successors, (0), 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-07-09 22:05:52,757 INFO L276 IsEmpty]: Start isEmpty. Operand 30223 states and 65357 transitions. [2021-07-09 22:05:52,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 22:05:52,798 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:52,798 INFO L508 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, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:52,798 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 22:05:52,799 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:52,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:52,799 INFO L82 PathProgramCache]: Analyzing trace with hash 238994598, now seen corresponding path program 1 times [2021-07-09 22:05:52,799 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:52,799 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669478206] [2021-07-09 22:05:52,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:52,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:52,903 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:52,903 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:52,904 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:52,904 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:52,908 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:05:52,908 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:05:52,923 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:52,924 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:52,931 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:05:52,931 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:52,940 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:52,941 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:52,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:52,942 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:52,942 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669478206] [2021-07-09 22:05:52,942 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669478206] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:52,942 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:52,942 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:05:52,942 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653208605] [2021-07-09 22:05:52,943 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:05:52,943 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:52,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:05:52,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:05:52,943 INFO L87 Difference]: Start difference. First operand 30223 states and 65357 transitions. Second operand has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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-07-09 22:05:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:53,536 INFO L93 Difference]: Finished difference Result 38366 states and 77746 transitions. [2021-07-09 22:05:53,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:05:53,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 [2021-07-09 22:05:53,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:53,601 INFO L225 Difference]: With dead ends: 38366 [2021-07-09 22:05:53,601 INFO L226 Difference]: Without dead ends: 25838 [2021-07-09 22:05:53,601 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 90.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:05:53,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25838 states. [2021-07-09 22:05:54,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25838 to 25838. [2021-07-09 22:05:54,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25838 states, 25488 states have (on average 2.1917372881355934) internal successors, (55863), 25837 states have internal predecessors, (55863), 0 states have call successors, (0), 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-07-09 22:05:54,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25838 states to 25838 states and 55863 transitions. [2021-07-09 22:05:54,343 INFO L78 Accepts]: Start accepts. Automaton has 25838 states and 55863 transitions. Word has length 88 [2021-07-09 22:05:54,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:54,343 INFO L482 AbstractCegarLoop]: Abstraction has 25838 states and 55863 transitions. [2021-07-09 22:05:54,343 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 14.666666666666666) internal successors, (88), 6 states have internal predecessors, (88), 0 states have call successors, (0), 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-07-09 22:05:54,344 INFO L276 IsEmpty]: Start isEmpty. Operand 25838 states and 55863 transitions. [2021-07-09 22:05:54,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-09 22:05:54,378 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:54,378 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:54,378 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 22:05:54,378 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:54,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:54,379 INFO L82 PathProgramCache]: Analyzing trace with hash -161361136, now seen corresponding path program 1 times [2021-07-09 22:05:54,379 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:54,379 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312747773] [2021-07-09 22:05:54,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:54,440 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:54,440 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:54,441 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:54,441 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:54,444 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:54,444 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:54,448 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:05:54,449 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:05:54,463 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:54,463 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:54,471 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:05:54,472 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:54,480 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:54,480 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:54,481 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:54,481 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:54,481 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312747773] [2021-07-09 22:05:54,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312747773] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:54,481 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:54,481 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:05:54,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314629454] [2021-07-09 22:05:54,482 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:05:54,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:54,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:05:54,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:05:54,483 INFO L87 Difference]: Start difference. First operand 25838 states and 55863 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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-07-09 22:05:54,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:54,733 INFO L93 Difference]: Finished difference Result 26063 states and 52459 transitions. [2021-07-09 22:05:54,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 22:05:54,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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 89 [2021-07-09 22:05:54,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:54,768 INFO L225 Difference]: With dead ends: 26063 [2021-07-09 22:05:54,768 INFO L226 Difference]: Without dead ends: 15421 [2021-07-09 22:05:54,769 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 97.2ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 22:05:54,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15421 states. [2021-07-09 22:05:55,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15421 to 15405. [2021-07-09 22:05:55,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15405 states, 15111 states have (on average 2.2060088677122627) internal successors, (33335), 15404 states have internal predecessors, (33335), 0 states have call successors, (0), 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-07-09 22:05:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15405 states to 15405 states and 33335 transitions. [2021-07-09 22:05:55,244 INFO L78 Accepts]: Start accepts. Automaton has 15405 states and 33335 transitions. Word has length 89 [2021-07-09 22:05:55,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:55,244 INFO L482 AbstractCegarLoop]: Abstraction has 15405 states and 33335 transitions. [2021-07-09 22:05:55,245 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 7 states have internal predecessors, (89), 0 states have call successors, (0), 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-07-09 22:05:55,245 INFO L276 IsEmpty]: Start isEmpty. Operand 15405 states and 33335 transitions. [2021-07-09 22:05:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-09 22:05:55,260 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:55,260 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:55,261 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 22:05:55,261 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:55,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:55,261 INFO L82 PathProgramCache]: Analyzing trace with hash -2142796241, now seen corresponding path program 1 times [2021-07-09 22:05:55,261 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:55,261 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832175567] [2021-07-09 22:05:55,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:55,311 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:55,312 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:55,312 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:55,313 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:55,316 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:55,316 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:55,329 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:55,330 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:55,337 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:55,337 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:55,345 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:55,346 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:55,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:55,346 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:55,346 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832175567] [2021-07-09 22:05:55,346 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832175567] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:55,346 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:55,347 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 22:05:55,347 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979821000] [2021-07-09 22:05:55,347 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 22:05:55,347 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:55,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 22:05:55,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 22:05:55,348 INFO L87 Difference]: Start difference. First operand 15405 states and 33335 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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-07-09 22:05:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:55,578 INFO L93 Difference]: Finished difference Result 25760 states and 58173 transitions. [2021-07-09 22:05:55,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 22:05:55,578 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2021-07-09 22:05:55,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:55,612 INFO L225 Difference]: With dead ends: 25760 [2021-07-09 22:05:55,612 INFO L226 Difference]: Without dead ends: 15117 [2021-07-09 22:05:55,613 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 91.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:05:55,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15117 states. [2021-07-09 22:05:56,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15117 to 13941. [2021-07-09 22:05:56,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13941 states, 13695 states have (on average 2.2154801022270902) internal successors, (30341), 13940 states have internal predecessors, (30341), 0 states have call successors, (0), 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-07-09 22:05:56,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13941 states to 13941 states and 30341 transitions. [2021-07-09 22:05:56,090 INFO L78 Accepts]: Start accepts. Automaton has 13941 states and 30341 transitions. Word has length 91 [2021-07-09 22:05:56,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:56,091 INFO L482 AbstractCegarLoop]: Abstraction has 13941 states and 30341 transitions. [2021-07-09 22:05:56,091 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 6 states have internal predecessors, (91), 0 states have call successors, (0), 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-07-09 22:05:56,091 INFO L276 IsEmpty]: Start isEmpty. Operand 13941 states and 30341 transitions. [2021-07-09 22:05:56,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-07-09 22:05:56,106 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:56,106 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:56,107 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 22:05:56,107 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:56,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:56,107 INFO L82 PathProgramCache]: Analyzing trace with hash -899627287, now seen corresponding path program 1 times [2021-07-09 22:05:56,107 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:56,107 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875001266] [2021-07-09 22:05:56,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:56,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:56,178 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,179 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:56,179 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,180 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,183 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,183 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,187 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,193 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:05:56,194 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:05:56,210 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,211 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:56,220 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:05:56,220 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:56,230 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,230 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:56,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:56,231 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:56,231 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875001266] [2021-07-09 22:05:56,231 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1875001266] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:56,231 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:56,231 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 22:05:56,232 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340400689] [2021-07-09 22:05:56,232 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 22:05:56,232 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:56,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 22:05:56,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 22:05:56,233 INFO L87 Difference]: Start difference. First operand 13941 states and 30341 transitions. Second operand has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-07-09 22:05:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:56,453 INFO L93 Difference]: Finished difference Result 11338 states and 22987 transitions. [2021-07-09 22:05:56,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 22:05:56,454 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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 92 [2021-07-09 22:05:56,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:56,465 INFO L225 Difference]: With dead ends: 11338 [2021-07-09 22:05:56,465 INFO L226 Difference]: Without dead ends: 5800 [2021-07-09 22:05:56,466 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 124.8ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 22:05:56,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5800 states. [2021-07-09 22:05:56,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5800 to 5776. [2021-07-09 22:05:56,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5776 states, 5650 states have (on average 2.1465486725663716) internal successors, (12128), 5775 states have internal predecessors, (12128), 0 states have call successors, (0), 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-07-09 22:05:56,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5776 states to 5776 states and 12128 transitions. [2021-07-09 22:05:56,568 INFO L78 Accepts]: Start accepts. Automaton has 5776 states and 12128 transitions. Word has length 92 [2021-07-09 22:05:56,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:56,568 INFO L482 AbstractCegarLoop]: Abstraction has 5776 states and 12128 transitions. [2021-07-09 22:05:56,568 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 11.5) internal successors, (92), 8 states have internal predecessors, (92), 0 states have call successors, (0), 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-07-09 22:05:56,568 INFO L276 IsEmpty]: Start isEmpty. Operand 5776 states and 12128 transitions. [2021-07-09 22:05:56,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-07-09 22:05:56,576 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:56,576 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:56,577 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 22:05:56,577 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:56,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash 425086589, now seen corresponding path program 1 times [2021-07-09 22:05:56,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:56,578 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721841086] [2021-07-09 22:05:56,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:56,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:56,666 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,666 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:56,667 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,667 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,670 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,670 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,674 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,675 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,679 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,680 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:56,686 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.8 percent of original size [2021-07-09 22:05:56,687 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 23 [2021-07-09 22:05:56,703 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,704 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 7 [2021-07-09 22:05:56,713 INFO L142 QuantifierPusher]: treesize reduction 11, result has 45.0 percent of original size [2021-07-09 22:05:56,713 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:56,723 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:56,724 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:56,724 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:56,724 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721841086] [2021-07-09 22:05:56,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721841086] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:56,724 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:56,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 22:05:56,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656572126] [2021-07-09 22:05:56,725 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 22:05:56,725 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:56,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 22:05:56,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-09 22:05:56,729 INFO L87 Difference]: Start difference. First operand 5776 states and 12128 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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-07-09 22:05:56,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:56,931 INFO L93 Difference]: Finished difference Result 4128 states and 7641 transitions. [2021-07-09 22:05:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 22:05:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2021-07-09 22:05:56,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:56,934 INFO L225 Difference]: With dead ends: 4128 [2021-07-09 22:05:56,935 INFO L226 Difference]: Without dead ends: 1731 [2021-07-09 22:05:56,935 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 146.1ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-09 22:05:56,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1731 states. [2021-07-09 22:05:56,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1731 to 1650. [2021-07-09 22:05:56,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1650 states, 1623 states have (on average 1.7239679605668514) internal successors, (2798), 1649 states have internal predecessors, (2798), 0 states have call successors, (0), 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-07-09 22:05:56,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1650 states to 1650 states and 2798 transitions. [2021-07-09 22:05:56,962 INFO L78 Accepts]: Start accepts. Automaton has 1650 states and 2798 transitions. Word has length 96 [2021-07-09 22:05:56,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:56,962 INFO L482 AbstractCegarLoop]: Abstraction has 1650 states and 2798 transitions. [2021-07-09 22:05:56,962 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 0 states have call successors, (0), 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-07-09 22:05:56,962 INFO L276 IsEmpty]: Start isEmpty. Operand 1650 states and 2798 transitions. [2021-07-09 22:05:56,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-09 22:05:56,965 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:56,965 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:56,965 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 22:05:56,966 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:56,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:56,966 INFO L82 PathProgramCache]: Analyzing trace with hash -313907013, now seen corresponding path program 1 times [2021-07-09 22:05:56,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:56,966 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1161005805] [2021-07-09 22:05:56,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 22:05:57,186 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:57,187 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:57,188 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:57,188 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:57,191 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:57,191 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 3 [2021-07-09 22:05:57,196 INFO L142 QuantifierPusher]: treesize reduction 1, result has 95.0 percent of original size [2021-07-09 22:05:57,198 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 19 [2021-07-09 22:05:57,216 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:57,217 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:57,226 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:57,226 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 9 [2021-07-09 22:05:57,235 INFO L142 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size [2021-07-09 22:05:57,236 INFO L147 QuantifierPusher]: treesize reduction 0, result has 100.0 percent of original size 1 [2021-07-09 22:05:57,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 22:05:57,236 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 22:05:57,236 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1161005805] [2021-07-09 22:05:57,236 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1161005805] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 22:05:57,236 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 22:05:57,236 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 22:05:57,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235354142] [2021-07-09 22:05:57,237 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 22:05:57,237 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 22:05:57,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 22:05:57,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 22:05:57,238 INFO L87 Difference]: Start difference. First operand 1650 states and 2798 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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-07-09 22:05:57,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 22:05:57,323 INFO L93 Difference]: Finished difference Result 2151 states and 4042 transitions. [2021-07-09 22:05:57,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 22:05:57,324 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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 100 [2021-07-09 22:05:57,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 22:05:57,326 INFO L225 Difference]: With dead ends: 2151 [2021-07-09 22:05:57,326 INFO L226 Difference]: Without dead ends: 865 [2021-07-09 22:05:57,327 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 85.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 22:05:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2021-07-09 22:05:57,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 865. [2021-07-09 22:05:57,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 838 states have (on average 2.1050119331742243) internal successors, (1764), 864 states have internal predecessors, (1764), 0 states have call successors, (0), 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-07-09 22:05:57,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1764 transitions. [2021-07-09 22:05:57,340 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1764 transitions. Word has length 100 [2021-07-09 22:05:57,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 22:05:57,340 INFO L482 AbstractCegarLoop]: Abstraction has 865 states and 1764 transitions. [2021-07-09 22:05:57,340 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 0 states have call successors, (0), 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-07-09 22:05:57,340 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1764 transitions. [2021-07-09 22:05:57,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-09 22:05:57,342 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 22:05:57,342 INFO L508 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-07-09 22:05:57,342 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 22:05:57,342 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 22:05:57,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 22:05:57,342 INFO L82 PathProgramCache]: Analyzing trace with hash 331922997, now seen corresponding path program 2 times [2021-07-09 22:05:57,343 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 22:05:57,343 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925755092] [2021-07-09 22:05:57,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 22:05:57,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:05:57,393 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:05:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 22:05:57,438 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 22:05:57,496 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 22:05:57,496 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 22:05:57,496 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 22:05:57,497 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-09 22:05:57,499 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 22:05:57,675 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 10:05:57 BasicIcfg [2021-07-09 22:05:57,675 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 22:05:57,676 INFO L168 Benchmark]: Toolchain (without parser) took 31583.26 ms. Allocated memory was 198.2 MB in the beginning and 7.0 GB in the end (delta: 6.8 GB). Free memory was 161.2 MB in the beginning and 5.4 GB in the end (delta: -5.3 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-07-09 22:05:57,676 INFO L168 Benchmark]: CDTParser took 0.59 ms. Allocated memory is still 198.2 MB. Free memory is still 179.4 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 22:05:57,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.32 ms. Allocated memory is still 198.2 MB. Free memory was 161.0 MB in the beginning and 168.4 MB in the end (delta: -7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-07-09 22:05:57,676 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.77 ms. Allocated memory is still 198.2 MB. Free memory was 168.4 MB in the beginning and 165.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:05:57,676 INFO L168 Benchmark]: Boogie Preprocessor took 53.84 ms. Allocated memory is still 198.2 MB. Free memory was 165.5 MB in the beginning and 163.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 22:05:57,681 INFO L168 Benchmark]: RCFGBuilder took 1896.44 ms. Allocated memory was 198.2 MB in the beginning and 240.1 MB in the end (delta: 41.9 MB). Free memory was 163.2 MB in the beginning and 214.1 MB in the end (delta: -50.9 MB). Peak memory consumption was 104.3 MB. Max. memory is 8.0 GB. [2021-07-09 22:05:57,682 INFO L168 Benchmark]: TraceAbstraction took 28925.14 ms. Allocated memory was 240.1 MB in the beginning and 7.0 GB in the end (delta: 6.7 GB). Free memory was 213.6 MB in the beginning and 5.4 GB in the end (delta: -5.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. [2021-07-09 22:05:57,682 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.59 ms. Allocated memory is still 198.2 MB. Free memory is still 179.4 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 592.32 ms. Allocated memory is still 198.2 MB. Free memory was 161.0 MB in the beginning and 168.4 MB in the end (delta: -7.4 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 94.77 ms. Allocated memory is still 198.2 MB. Free memory was 168.4 MB in the beginning and 165.5 MB in the end (delta: 2.9 MB). Peak memory consumption was 3.1 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 53.84 ms. Allocated memory is still 198.2 MB. Free memory was 165.5 MB in the beginning and 163.2 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1896.44 ms. Allocated memory was 198.2 MB in the beginning and 240.1 MB in the end (delta: 41.9 MB). Free memory was 163.2 MB in the beginning and 214.1 MB in the end (delta: -50.9 MB). Peak memory consumption was 104.3 MB. Max. memory is 8.0 GB. * TraceAbstraction took 28925.14 ms. Allocated memory was 240.1 MB in the beginning and 7.0 GB in the end (delta: 6.7 GB). Free memory was 213.6 MB in the beginning and 5.4 GB in the end (delta: -5.2 GB). Peak memory consumption was 1.5 GB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Independence relation benchmarks ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 373919, positive: 355684, positive conditional: 355684, positive unconditional: 0, negative: 18235, negative conditional: 18235, negative unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 366953, positive: 355684, positive conditional: 0, positive unconditional: 355684, negative: 11269, negative conditional: 0, negative unconditional: 11269, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 1356, positive: 1318, positive conditional: 0, positive unconditional: 1318, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 1356, positive: 1309, positive conditional: 0, positive unconditional: 1309, negative: 47, negative conditional: 0, negative unconditional: 47, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Independence Queries: [ total: 47, positive: 9, positive conditional: 0, positive unconditional: 9, negative: 38, negative conditional: 0, negative unconditional: 38, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 490, positive: 14, positive conditional: 0, positive unconditional: 14, negative: 476, negative conditional: 0, negative unconditional: 476, unknown: 0, unknown conditional: 0, unknown unconditional: 0] ], Cache Queries: [ total: 366953, positive: 354366, positive conditional: 0, positive unconditional: 354366, negative: 11231, negative conditional: 0, negative unconditional: 11231, unknown: 1356, unknown conditional: 0, unknown unconditional: 1356] , Statistics on independence cache: Total cache size (in pairs): 1356, Positive cache size: 1318, Positive conditional cache size: 0, Positive unconditional cache size: 1318, Negative cache size: 38, Negative conditional cache size: 0, Negative unconditional cache size: 38, Independence queries for same thread: 6966 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L710] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L712] 0 int __unbuffered_p0_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0] [L714] 0 int __unbuffered_p3_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0] [L716] 0 int __unbuffered_p3_EBX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0] [L718] 0 int a = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0] [L720] 0 int b = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0] [L721] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0] [L722] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0] [L724] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L726] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L728] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0] [L729] 0 _Bool z$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0] [L730] 0 int z$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0] [L731] 0 _Bool z$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0] [L732] 0 _Bool z$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0] [L733] 0 _Bool z$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0] [L734] 0 _Bool z$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0] [L735] 0 _Bool z$r_buff0_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0] [L736] 0 _Bool z$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0] [L737] 0 _Bool z$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0] [L738] 0 _Bool z$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0] [L739] 0 _Bool z$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0] [L740] 0 _Bool z$r_buff1_thd4; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0] [L741] 0 _Bool z$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0] [L742] 0 int *z$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}] [L743] 0 int z$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0] [L744] 0 _Bool z$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0] [L745] 0 int z$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0] [L746] 0 _Bool z$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L747] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L748] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L846] 0 pthread_t t1221; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] FCALL, FORK 0 pthread_create(&t1221, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L848] 0 pthread_t t1222; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L849] FCALL, FORK 0 pthread_create(&t1222, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L850] 0 pthread_t t1223; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L851] FCALL, FORK 0 pthread_create(&t1223, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 pthread_t t1224; VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L853] FCALL, FORK 0 pthread_create(&t1224, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff1 = z$w_buff0 [L803] 4 z$w_buff0 = 2 [L804] 4 z$w_buff1_used = z$w_buff0_used [L805] 4 z$w_buff0_used = (_Bool)1 [L18] COND FALSE 4 !(!expression) [L807] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L808] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L809] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L810] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L811] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L812] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L815] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L818] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L821] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L755] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 x = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] EXPR 3 z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z [L788] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L788] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L789] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L789] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L790] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L790] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L791] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L791] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L792] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L792] 3 z$r_buff1_thd3 = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$r_buff1_thd3 [L795] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L824] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L825] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L825] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L826] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L826] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L827] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L827] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L828] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L828] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 [L831] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L855] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] EXPR 0 z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z [L859] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L859] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L860] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L860] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L861] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L861] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L862] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L862] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L863] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L863] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L866] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L867] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L868] 0 z$flush_delayed = weak$$choice2 [L869] 0 z$mem_tmp = z [L870] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L870] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0) [L871] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L871] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1) [L872] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L872] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used) [L873] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L873] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L874] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L874] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0) [L875] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L875] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L876] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L876] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L877] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L878] EXPR 0 z$flush_delayed ? z$mem_tmp : z [L878] 0 z = z$flush_delayed ? z$mem_tmp : z [L879] 0 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L18] 0 reach_error() VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=49, weak$$choice2=0, x=1, y=2, z=2, z$flush_delayed=0, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 9 procedures, 165 locations, 7 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 28606.6ms, OverallIterations: 14, TraceHistogramMax: 1, EmptinessCheckTime: 1177.9ms, AutomataDifference: 8092.5ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 4923.4ms, PartialOrderReductionTime: 4893.2ms, HoareTripleCheckerStatistics: 2107 SDtfs, 3180 SDslu, 7843 SDs, 0 SdLazy, 865 SolverSat, 206 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1033.7ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2889.4ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=72173occurred in iteration=0, InterpolantAutomatonStates: 136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 10782.3ms AutomataMinimizationTime, 13 MinimizatonAttempts, 17188 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 56.4ms SsaConstructionTime, 857.8ms SatisfiabilityAnalysisTime, 2365.6ms InterpolantComputationTime, 1256 NumberOfCodeBlocks, 1256 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 1143 ConstructedInterpolants, 0 QuantifiedInterpolants, 4912 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 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...