/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.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 16:42:33,766 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-07-09 16:42:33,768 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-07-09 16:42:33,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-07-09 16:42:33,800 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-07-09 16:42:33,802 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-07-09 16:42:33,804 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-07-09 16:42:33,808 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-07-09 16:42:33,810 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-07-09 16:42:33,814 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-07-09 16:42:33,815 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-07-09 16:42:33,816 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-07-09 16:42:33,816 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-07-09 16:42:33,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-07-09 16:42:33,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-07-09 16:42:33,820 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-07-09 16:42:33,822 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-07-09 16:42:33,823 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-07-09 16:42:33,824 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-07-09 16:42:33,836 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-07-09 16:42:33,837 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-07-09 16:42:33,838 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-07-09 16:42:33,838 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-07-09 16:42:33,840 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-07-09 16:42:33,844 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-07-09 16:42:33,845 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-07-09 16:42:33,845 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-07-09 16:42:33,846 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-07-09 16:42:33,846 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-07-09 16:42:33,847 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-07-09 16:42:33,847 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-07-09 16:42:33,848 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-07-09 16:42:33,849 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-07-09 16:42:33,849 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-07-09 16:42:33,850 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-07-09 16:42:33,850 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-07-09 16:42:33,850 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-07-09 16:42:33,851 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-07-09 16:42:33,851 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-07-09 16:42:33,851 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-07-09 16:42:33,852 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-07-09 16:42:33,852 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.epf [2021-07-09 16:42:33,880 INFO L113 SettingsManager]: Loading preferences was successful [2021-07-09 16:42:33,880 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-07-09 16:42:33,881 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-07-09 16:42:33,881 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-07-09 16:42:33,883 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-07-09 16:42:33,883 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-07-09 16:42:33,883 INFO L138 SettingsManager]: * Use SBE=true [2021-07-09 16:42:33,883 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-07-09 16:42:33,884 INFO L138 SettingsManager]: * sizeof long=4 [2021-07-09 16:42:33,884 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-07-09 16:42:33,884 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-07-09 16:42:33,884 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * sizeof long double=12 [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * Use constant arrays=true [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-07-09 16:42:33,885 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-07-09 16:42:33,885 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * To the following directory=./dump/ [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-07-09 16:42:33,886 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-07-09 16:42:33,886 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-07-09 16:42:33,887 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-07-09 16:42:33,887 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-07-09 16:42:33,887 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 16:42:34,132 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-07-09 16:42:34,148 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-07-09 16:42:34,149 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-07-09 16:42:34,150 INFO L271 PluginConnector]: Initializing CDTParser... [2021-07-09 16:42:34,151 INFO L275 PluginConnector]: CDTParser initialized [2021-07-09 16:42:34,151 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 16:42:34,196 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb549378/1f37cf61d0a84db982034611ba3ace90/FLAGa2ddfa3aa [2021-07-09 16:42:34,656 INFO L306 CDTParser]: Found 1 translation units. [2021-07-09 16:42:34,656 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix046_power.opt.i [2021-07-09 16:42:34,666 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb549378/1f37cf61d0a84db982034611ba3ace90/FLAGa2ddfa3aa [2021-07-09 16:42:34,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3eb549378/1f37cf61d0a84db982034611ba3ace90 [2021-07-09 16:42:34,680 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-07-09 16:42:34,681 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2021-07-09 16:42:34,682 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-07-09 16:42:34,682 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-07-09 16:42:34,685 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-07-09 16:42:34,685 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:42:34" (1/1) ... [2021-07-09 16:42:34,686 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29c24be9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:34, skipping insertion in model container [2021-07-09 16:42:34,686 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.07 04:42:34" (1/1) ... [2021-07-09 16:42:34,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-07-09 16:42:34,713 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-07-09 16:42:34,839 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 16:42:35,011 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:42:35,018 INFO L203 MainTranslator]: Completed pre-run [2021-07-09 16:42:35,026 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 16:42:35,075 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-07-09 16:42:35,109 INFO L208 MainTranslator]: Completed translation [2021-07-09 16:42:35,110 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35 WrapperNode [2021-07-09 16:42:35,110 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-07-09 16:42:35,111 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-07-09 16:42:35,111 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-07-09 16:42:35,111 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-07-09 16:42:35,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,127 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-07-09 16:42:35,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-07-09 16:42:35,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-07-09 16:42:35,167 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-07-09 16:42:35,174 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,174 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,179 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,180 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,185 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,195 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,198 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (1/1) ... [2021-07-09 16:42:35,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-07-09 16:42:35,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-07-09 16:42:35,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-07-09 16:42:35,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-07-09 16:42:35,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (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 16:42:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-07-09 16:42:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2021-07-09 16:42:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-07-09 16:42:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-07-09 16:42:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2021-07-09 16:42:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2021-07-09 16:42:35,269 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2021-07-09 16:42:35,269 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2021-07-09 16:42:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2021-07-09 16:42:35,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2021-07-09 16:42:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2021-07-09 16:42:35,270 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2021-07-09 16:42:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-07-09 16:42:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2021-07-09 16:42:35,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-07-09 16:42:35,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-07-09 16:42:35,271 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 16:42:36,494 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-07-09 16:42:36,495 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2021-07-09 16:42:36,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:42:36 BoogieIcfgContainer [2021-07-09 16:42:36,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-07-09 16:42:36,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-07-09 16:42:36,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-07-09 16:42:36,499 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-07-09 16:42:36,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.07 04:42:34" (1/3) ... [2021-07-09 16:42:36,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acb335d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:42:36, skipping insertion in model container [2021-07-09 16:42:36,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.07 04:42:35" (2/3) ... [2021-07-09 16:42:36,500 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2acb335d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.07 04:42:36, skipping insertion in model container [2021-07-09 16:42:36,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.07 04:42:36" (3/3) ... [2021-07-09 16:42:36,501 INFO L111 eAbstractionObserver]: Analyzing ICFG mix046_power.opt.i [2021-07-09 16:42:36,506 WARN L148 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2021-07-09 16:42:36,506 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-07-09 16:42:36,506 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2021-07-09 16:42:36,506 INFO L474 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2021-07-09 16:42:36,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,534 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,534 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,534 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,535 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,536 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,536 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,537 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,537 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,538 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,539 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,539 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,540 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,541 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,542 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,542 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,543 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,544 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,545 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,546 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,548 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,549 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,549 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,550 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,550 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,551 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,551 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,552 WARN L313 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,553 WARN L313 ript$VariableManager]: TermVariabe P3Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,553 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,553 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,554 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,554 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2021-07-09 16:42:36,554 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2021-07-09 16:42:36,569 INFO L255 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2021-07-09 16:42:36,581 INFO L378 AbstractCegarLoop]: Interprodecural is true [2021-07-09 16:42:36,582 INFO L379 AbstractCegarLoop]: Hoare is false [2021-07-09 16:42:36,582 INFO L380 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-07-09 16:42:36,582 INFO L381 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-07-09 16:42:36,582 INFO L382 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-07-09 16:42:36,582 INFO L383 AbstractCegarLoop]: Difference is false [2021-07-09 16:42:36,582 INFO L384 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-07-09 16:42:36,582 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == ULTIMATE.start======== [2021-07-09 16:42:36,590 INFO L110 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 140 places, 129 transitions, 278 flow [2021-07-09 16:42:38,419 INFO L132 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 72173 states, 72171 states have (on average 4.4514832827590025) internal successors, (321268), 72172 states have internal predecessors, (321268), 0 states have call successors, (0), 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 16:42:38,568 INFO L276 IsEmpty]: Start isEmpty. Operand has 72173 states, 72171 states have (on average 4.4514832827590025) internal successors, (321268), 72172 states have internal predecessors, (321268), 0 states have call successors, (0), 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 16:42:38,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2021-07-09 16:42:38,690 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:42:38,691 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 16:42:38,691 INFO L430 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:42:38,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:42:38,698 INFO L82 PathProgramCache]: Analyzing trace with hash -317353279, now seen corresponding path program 1 times [2021-07-09 16:42:38,863 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:42:38,863 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482711270] [2021-07-09 16:42:38,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:42:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:42:39,323 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 16:42:39,324 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:42:39,324 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482711270] [2021-07-09 16:42:39,325 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482711270] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:42:39,325 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:42:39,325 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:42:39,326 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653500739] [2021-07-09 16:42:39,329 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:42:39,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:42:39,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:42:39,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:42:39,458 INFO L87 Difference]: Start difference. First operand has 72173 states, 72171 states have (on average 4.4514832827590025) internal successors, (321268), 72172 states have internal predecessors, (321268), 0 states have call successors, (0), 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 16:42:40,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:42:40,988 INFO L93 Difference]: Finished difference Result 86649 states and 377482 transitions. [2021-07-09 16:42:40,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:42:40,990 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 16:42:40,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:42:41,484 INFO L225 Difference]: With dead ends: 86649 [2021-07-09 16:42:41,484 INFO L226 Difference]: Without dead ends: 65089 [2021-07-09 16:42:41,485 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 79.2ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:42:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65089 states. [2021-07-09 16:42:44,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65089 to 65089. [2021-07-09 16:42:44,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65089 states, 65087 states have (on average 4.368721864581253) internal successors, (284347), 65088 states have internal predecessors, (284347), 0 states have call successors, (0), 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 16:42:45,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65089 states to 65089 states and 284347 transitions. [2021-07-09 16:42:45,079 INFO L78 Accepts]: Start accepts. Automaton has 65089 states and 284347 transitions. Word has length 80 [2021-07-09 16:42:45,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:42:45,080 INFO L482 AbstractCegarLoop]: Abstraction has 65089 states and 284347 transitions. [2021-07-09 16:42:45,080 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 16:42:45,080 INFO L276 IsEmpty]: Start isEmpty. Operand 65089 states and 284347 transitions. [2021-07-09 16:42:45,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2021-07-09 16:42:45,181 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:42:45,181 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] [2021-07-09 16:42:45,182 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-07-09 16:42:45,182 INFO L430 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:42:45,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:42:45,184 INFO L82 PathProgramCache]: Analyzing trace with hash -1472734654, now seen corresponding path program 1 times [2021-07-09 16:42:45,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:42:45,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809993918] [2021-07-09 16:42:45,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:42:45,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:42:45,307 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 16:42:45,307 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:42:45,307 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809993918] [2021-07-09 16:42:45,307 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809993918] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:42:45,307 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:42:45,307 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:42:45,307 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719166395] [2021-07-09 16:42:45,308 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:42:45,308 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:42:45,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:42:45,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:42:45,309 INFO L87 Difference]: Start difference. First operand 65089 states and 284347 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 16:42:46,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:42:46,398 INFO L93 Difference]: Finished difference Result 69989 states and 303177 transitions. [2021-07-09 16:42:46,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:42:46,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 82 [2021-07-09 16:42:46,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:42:46,735 INFO L225 Difference]: With dead ends: 69989 [2021-07-09 16:42:46,735 INFO L226 Difference]: Without dead ends: 51061 [2021-07-09 16:42:46,736 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 70.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:42:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51061 states. [2021-07-09 16:42:48,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51061 to 51061. [2021-07-09 16:42:48,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51061 states, 51060 states have (on average 4.322326674500587) internal successors, (220698), 51060 states have internal predecessors, (220698), 0 states have call successors, (0), 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 16:42:49,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51061 states to 51061 states and 220698 transitions. [2021-07-09 16:42:49,160 INFO L78 Accepts]: Start accepts. Automaton has 51061 states and 220698 transitions. Word has length 82 [2021-07-09 16:42:49,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:42:49,160 INFO L482 AbstractCegarLoop]: Abstraction has 51061 states and 220698 transitions. [2021-07-09 16:42:49,161 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 6 states have internal predecessors, (82), 0 states have call successors, (0), 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 16:42:49,161 INFO L276 IsEmpty]: Start isEmpty. Operand 51061 states and 220698 transitions. [2021-07-09 16:42:49,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2021-07-09 16:42:49,254 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:42:49,254 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 16:42:49,254 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-07-09 16:42:49,254 INFO L430 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:42:49,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:42:49,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1729629605, now seen corresponding path program 1 times [2021-07-09 16:42:49,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:42:49,255 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597342349] [2021-07-09 16:42:49,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:42:49,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:42:49,506 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 16:42:49,506 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:42:49,507 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597342349] [2021-07-09 16:42:49,507 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597342349] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:42:49,507 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:42:49,507 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:42:49,507 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890063267] [2021-07-09 16:42:49,508 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:42:49,509 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:42:49,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:42:49,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:42:49,509 INFO L87 Difference]: Start difference. First operand 51061 states and 220698 transitions. Second operand has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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 16:42:50,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:42:50,334 INFO L93 Difference]: Finished difference Result 58201 states and 249820 transitions. [2021-07-09 16:42:50,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:42:50,334 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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 16:42:50,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:42:50,622 INFO L225 Difference]: With dead ends: 58201 [2021-07-09 16:42:50,623 INFO L226 Difference]: Without dead ends: 49801 [2021-07-09 16:42:50,623 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 183.2ms TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:42:51,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49801 states. [2021-07-09 16:42:52,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49801 to 49801. [2021-07-09 16:42:52,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49801 states, 49800 states have (on average 4.313855421686747) internal successors, (214830), 49800 states have internal predecessors, (214830), 0 states have call successors, (0), 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 16:42:52,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49801 states to 49801 states and 214830 transitions. [2021-07-09 16:42:52,854 INFO L78 Accepts]: Start accepts. Automaton has 49801 states and 214830 transitions. Word has length 86 [2021-07-09 16:42:52,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:42:52,855 INFO L482 AbstractCegarLoop]: Abstraction has 49801 states and 214830 transitions. [2021-07-09 16:42:52,855 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 8.6) internal successors, (86), 10 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 16:42:52,855 INFO L276 IsEmpty]: Start isEmpty. Operand 49801 states and 214830 transitions. [2021-07-09 16:42:52,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-09 16:42:52,944 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:42:52,944 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 16:42:52,944 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-07-09 16:42:52,944 INFO L430 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:42:52,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:42:52,945 INFO L82 PathProgramCache]: Analyzing trace with hash -768095147, now seen corresponding path program 1 times [2021-07-09 16:42:52,945 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:42:52,945 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180904889] [2021-07-09 16:42:52,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:42:52,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:42:53,173 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 16:42:53,173 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:42:53,173 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180904889] [2021-07-09 16:42:53,173 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180904889] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:42:53,173 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:42:53,173 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:42:53,174 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221296324] [2021-07-09 16:42:53,174 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:42:53,174 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:42:53,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:42:53,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:42:53,175 INFO L87 Difference]: Start difference. First operand 49801 states and 214830 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 16:42:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:42:53,995 INFO L93 Difference]: Finished difference Result 57543 states and 247506 transitions. [2021-07-09 16:42:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:42:53,996 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 16:42:53,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:42:54,422 INFO L225 Difference]: With dead ends: 57543 [2021-07-09 16:42:54,423 INFO L226 Difference]: Without dead ends: 51663 [2021-07-09 16:42:54,423 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 138.8ms TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:42:54,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51663 states. [2021-07-09 16:42:56,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51663 to 51663. [2021-07-09 16:42:56,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51663 states, 51662 states have (on average 4.322596879718168) internal successors, (223314), 51662 states have internal predecessors, (223314), 0 states have call successors, (0), 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 16:42:56,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51663 states to 51663 states and 223314 transitions. [2021-07-09 16:42:56,440 INFO L78 Accepts]: Start accepts. Automaton has 51663 states and 223314 transitions. Word has length 87 [2021-07-09 16:42:56,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:42:56,440 INFO L482 AbstractCegarLoop]: Abstraction has 51663 states and 223314 transitions. [2021-07-09 16:42:56,441 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 16:42:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 51663 states and 223314 transitions. [2021-07-09 16:42:56,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-09 16:42:56,529 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:42:56,529 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 16:42:56,529 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-07-09 16:42:56,529 INFO L430 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:42:56,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:42:56,530 INFO L82 PathProgramCache]: Analyzing trace with hash -2021599257, now seen corresponding path program 2 times [2021-07-09 16:42:56,530 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:42:56,530 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831507601] [2021-07-09 16:42:56,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:42:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:42:56,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-07-09 16:42:56,953 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:42:56,954 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831507601] [2021-07-09 16:42:56,954 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831507601] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:42:56,954 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:42:56,955 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:42:56,955 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636307182] [2021-07-09 16:42:56,955 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:42:56,955 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:42:56,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:42:56,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:42:56,956 INFO L87 Difference]: Start difference. First operand 51663 states and 223314 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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 16:42:57,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:42:57,847 INFO L93 Difference]: Finished difference Result 57739 states and 248234 transitions. [2021-07-09 16:42:57,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:42:57,853 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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 16:42:57,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:42:58,148 INFO L225 Difference]: With dead ends: 57739 [2021-07-09 16:42:58,149 INFO L226 Difference]: Without dead ends: 51859 [2021-07-09 16:42:58,149 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 470.0ms TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:42:58,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51859 states. [2021-07-09 16:42:59,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51859 to 51565. [2021-07-09 16:42:59,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51565 states, 51564 states have (on average 4.32375300597316) internal successors, (222950), 51564 states have internal predecessors, (222950), 0 states have call successors, (0), 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 16:43:00,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51565 states to 51565 states and 222950 transitions. [2021-07-09 16:43:00,046 INFO L78 Accepts]: Start accepts. Automaton has 51565 states and 222950 transitions. Word has length 87 [2021-07-09 16:43:00,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:00,046 INFO L482 AbstractCegarLoop]: Abstraction has 51565 states and 222950 transitions. [2021-07-09 16:43:00,046 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 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 16:43:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 51565 states and 222950 transitions. [2021-07-09 16:43:00,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2021-07-09 16:43:00,415 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:00,415 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 16:43:00,416 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-07-09 16:43:00,416 INFO L430 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:00,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:00,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1788685425, now seen corresponding path program 3 times [2021-07-09 16:43:00,416 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:00,416 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444348195] [2021-07-09 16:43:00,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:00,624 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 16:43:00,625 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:00,625 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444348195] [2021-07-09 16:43:00,625 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444348195] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:00,625 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:00,625 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2021-07-09 16:43:00,625 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463818651] [2021-07-09 16:43:00,626 INFO L462 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-07-09 16:43:00,626 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:00,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-07-09 16:43:00,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-07-09 16:43:00,626 INFO L87 Difference]: Start difference. First operand 51565 states and 222950 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 16:43:01,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:01,519 INFO L93 Difference]: Finished difference Result 60581 states and 260603 transitions. [2021-07-09 16:43:01,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:43:01,520 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 16:43:01,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:01,833 INFO L225 Difference]: With dead ends: 60581 [2021-07-09 16:43:01,835 INFO L226 Difference]: Without dead ends: 53917 [2021-07-09 16:43:01,835 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 158.4ms TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2021-07-09 16:43:02,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53917 states. [2021-07-09 16:43:03,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53917 to 50977. [2021-07-09 16:43:03,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50977 states, 50976 states have (on average 4.310597143753923) internal successors, (219737), 50976 states have internal predecessors, (219737), 0 states have call successors, (0), 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 16:43:03,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50977 states to 50977 states and 219737 transitions. [2021-07-09 16:43:03,831 INFO L78 Accepts]: Start accepts. Automaton has 50977 states and 219737 transitions. Word has length 87 [2021-07-09 16:43:03,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:03,831 INFO L482 AbstractCegarLoop]: Abstraction has 50977 states and 219737 transitions. [2021-07-09 16:43:03,831 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 16:43:03,831 INFO L276 IsEmpty]: Start isEmpty. Operand 50977 states and 219737 transitions. [2021-07-09 16:43:04,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 16:43:04,252 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:04,252 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 16:43:04,252 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-07-09 16:43:04,253 INFO L430 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:04,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:04,253 INFO L82 PathProgramCache]: Analyzing trace with hash 1329606822, now seen corresponding path program 1 times [2021-07-09 16:43:04,253 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:04,253 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950438483] [2021-07-09 16:43:04,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:04,409 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 16:43:04,410 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:04,410 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950438483] [2021-07-09 16:43:04,410 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950438483] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:04,410 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:04,410 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:43:04,410 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802537852] [2021-07-09 16:43:04,410 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:43:04,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:04,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:43:04,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:43:04,411 INFO L87 Difference]: Start difference. First operand 50977 states and 219737 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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 16:43:05,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:05,304 INFO L93 Difference]: Finished difference Result 64501 states and 278005 transitions. [2021-07-09 16:43:05,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-07-09 16:43:05,305 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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 16:43:05,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:05,622 INFO L225 Difference]: With dead ends: 64501 [2021-07-09 16:43:05,622 INFO L226 Difference]: Without dead ends: 59797 [2021-07-09 16:43:05,622 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 144.9ms TimeCoverageRelationStatistics Valid=86, Invalid=256, Unknown=0, NotChecked=0, Total=342 [2021-07-09 16:43:05,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59797 states. [2021-07-09 16:43:07,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59797 to 58033. [2021-07-09 16:43:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58033 states, 58032 states have (on average 4.31577405569341) internal successors, (250453), 58032 states have internal predecessors, (250453), 0 states have call successors, (0), 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 16:43:08,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58033 states to 58033 states and 250453 transitions. [2021-07-09 16:43:08,261 INFO L78 Accepts]: Start accepts. Automaton has 58033 states and 250453 transitions. Word has length 88 [2021-07-09 16:43:08,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:08,261 INFO L482 AbstractCegarLoop]: Abstraction has 58033 states and 250453 transitions. [2021-07-09 16:43:08,262 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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 16:43:08,262 INFO L276 IsEmpty]: Start isEmpty. Operand 58033 states and 250453 transitions. [2021-07-09 16:43:08,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 16:43:08,438 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:08,443 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 16:43:08,443 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-07-09 16:43:08,443 INFO L430 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:08,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:08,444 INFO L82 PathProgramCache]: Analyzing trace with hash -555431712, now seen corresponding path program 2 times [2021-07-09 16:43:08,444 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:08,444 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48354357] [2021-07-09 16:43:08,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:08,715 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 16:43:08,715 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:08,715 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48354357] [2021-07-09 16:43:08,715 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48354357] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:08,715 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:08,715 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:43:08,716 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734937338] [2021-07-09 16:43:08,716 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:43:08,716 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:08,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:43:08,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:43:08,717 INFO L87 Difference]: Start difference. First operand 58033 states and 250453 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 16:43:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:09,739 INFO L93 Difference]: Finished difference Result 71655 states and 309085 transitions. [2021-07-09 16:43:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:43:09,740 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 16:43:09,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:10,223 INFO L225 Difference]: With dead ends: 71655 [2021-07-09 16:43:10,223 INFO L226 Difference]: Without dead ends: 66951 [2021-07-09 16:43:10,223 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 233.2ms TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:43:10,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66951 states. [2021-07-09 16:43:12,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66951 to 59895. [2021-07-09 16:43:12,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59895 states, 59894 states have (on average 4.323254416135172) internal successors, (258937), 59894 states have internal predecessors, (258937), 0 states have call successors, (0), 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 16:43:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59895 states to 59895 states and 258937 transitions. [2021-07-09 16:43:12,906 INFO L78 Accepts]: Start accepts. Automaton has 59895 states and 258937 transitions. Word has length 88 [2021-07-09 16:43:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:12,906 INFO L482 AbstractCegarLoop]: Abstraction has 59895 states and 258937 transitions. [2021-07-09 16:43:12,906 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 16:43:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 59895 states and 258937 transitions. [2021-07-09 16:43:13,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 16:43:13,014 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:13,014 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 16:43:13,014 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-07-09 16:43:13,014 INFO L430 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:13,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:13,014 INFO L82 PathProgramCache]: Analyzing trace with hash -2008549280, now seen corresponding path program 3 times [2021-07-09 16:43:13,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:13,015 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602915305] [2021-07-09 16:43:13,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:13,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:13,574 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 16:43:13,574 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:13,574 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602915305] [2021-07-09 16:43:13,574 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602915305] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:13,575 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:13,575 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2021-07-09 16:43:13,575 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359904897] [2021-07-09 16:43:13,575 INFO L462 AbstractCegarLoop]: Interpolant automaton has 13 states [2021-07-09 16:43:13,575 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:13,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2021-07-09 16:43:13,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:43:13,576 INFO L87 Difference]: Start difference. First operand 59895 states and 258937 transitions. Second operand has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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 16:43:14,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:14,450 INFO L93 Difference]: Finished difference Result 65579 states and 281813 transitions. [2021-07-09 16:43:14,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2021-07-09 16:43:14,451 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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 16:43:14,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:14,759 INFO L225 Difference]: With dead ends: 65579 [2021-07-09 16:43:14,759 INFO L226 Difference]: Without dead ends: 60875 [2021-07-09 16:43:14,759 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 273.2ms TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2021-07-09 16:43:15,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60875 states. [2021-07-09 16:43:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60875 to 59797. [2021-07-09 16:43:16,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59797 states, 59796 states have (on average 4.324252458358418) internal successors, (258573), 59796 states have internal predecessors, (258573), 0 states have call successors, (0), 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 16:43:17,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59797 states to 59797 states and 258573 transitions. [2021-07-09 16:43:17,220 INFO L78 Accepts]: Start accepts. Automaton has 59797 states and 258573 transitions. Word has length 88 [2021-07-09 16:43:17,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:17,220 INFO L482 AbstractCegarLoop]: Abstraction has 59797 states and 258573 transitions. [2021-07-09 16:43:17,221 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 6.769230769230769) internal successors, (88), 13 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 16:43:17,221 INFO L276 IsEmpty]: Start isEmpty. Operand 59797 states and 258573 transitions. [2021-07-09 16:43:17,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 16:43:17,355 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:17,355 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 16:43:17,355 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-07-09 16:43:17,355 INFO L430 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:17,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:17,356 INFO L82 PathProgramCache]: Analyzing trace with hash -2128959258, now seen corresponding path program 4 times [2021-07-09 16:43:17,356 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:17,356 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725883727] [2021-07-09 16:43:17,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:17,526 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 16:43:17,526 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:17,526 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725883727] [2021-07-09 16:43:17,526 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725883727] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:17,527 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:17,527 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2021-07-09 16:43:17,527 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455031217] [2021-07-09 16:43:17,527 INFO L462 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-07-09 16:43:17,527 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:17,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-07-09 16:43:17,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2021-07-09 16:43:17,528 INFO L87 Difference]: Start difference. First operand 59797 states and 258573 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 16:43:18,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:18,566 INFO L93 Difference]: Finished difference Result 78221 states and 333767 transitions. [2021-07-09 16:43:18,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-07-09 16:43:18,567 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 16:43:18,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:19,112 INFO L225 Difference]: With dead ends: 78221 [2021-07-09 16:43:19,112 INFO L226 Difference]: Without dead ends: 61561 [2021-07-09 16:43:19,113 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 184.2ms TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2021-07-09 16:43:19,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61561 states. [2021-07-09 16:43:20,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61561 to 46861. [2021-07-09 16:43:20,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46861 states, 46860 states have (on average 4.263636363636364) internal successors, (199794), 46860 states have internal predecessors, (199794), 0 states have call successors, (0), 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 16:43:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46861 states to 46861 states and 199794 transitions. [2021-07-09 16:43:21,105 INFO L78 Accepts]: Start accepts. Automaton has 46861 states and 199794 transitions. Word has length 88 [2021-07-09 16:43:21,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:21,105 INFO L482 AbstractCegarLoop]: Abstraction has 46861 states and 199794 transitions. [2021-07-09 16:43:21,106 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 16:43:21,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46861 states and 199794 transitions. [2021-07-09 16:43:21,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2021-07-09 16:43:21,197 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:21,197 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 16:43:21,197 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-07-09 16:43:21,197 INFO L430 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:21,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:21,198 INFO L82 PathProgramCache]: Analyzing trace with hash -2135292570, now seen corresponding path program 1 times [2021-07-09 16:43:21,198 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:21,198 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779477374] [2021-07-09 16:43:21,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:21,262 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 16:43:21,262 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:21,262 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779477374] [2021-07-09 16:43:21,262 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779477374] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:21,262 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:21,263 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:43:21,263 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612210469] [2021-07-09 16:43:21,263 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:43:21,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:21,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:43:21,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:43:21,264 INFO L87 Difference]: Start difference. First operand 46861 states and 199794 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 16:43:22,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:22,044 INFO L93 Difference]: Finished difference Result 58845 states and 247658 transitions. [2021-07-09 16:43:22,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:43:22,045 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 16:43:22,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:22,249 INFO L225 Difference]: With dead ends: 58845 [2021-07-09 16:43:22,250 INFO L226 Difference]: Without dead ends: 43165 [2021-07-09 16:43:22,250 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 55.9ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:43:22,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43165 states. [2021-07-09 16:43:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43165 to 43165. [2021-07-09 16:43:23,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43165 states, 43164 states have (on average 4.202807895468446) internal successors, (181410), 43164 states have internal predecessors, (181410), 0 states have call successors, (0), 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 16:43:23,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43165 states to 43165 states and 181410 transitions. [2021-07-09 16:43:23,732 INFO L78 Accepts]: Start accepts. Automaton has 43165 states and 181410 transitions. Word has length 88 [2021-07-09 16:43:23,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:23,732 INFO L482 AbstractCegarLoop]: Abstraction has 43165 states and 181410 transitions. [2021-07-09 16:43:23,732 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 16:43:23,733 INFO L276 IsEmpty]: Start isEmpty. Operand 43165 states and 181410 transitions. [2021-07-09 16:43:23,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-07-09 16:43:23,810 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:23,810 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 16:43:23,810 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-07-09 16:43:23,810 INFO L430 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:23,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:23,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1516513904, now seen corresponding path program 1 times [2021-07-09 16:43:23,811 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:23,811 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326163453] [2021-07-09 16:43:23,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:23,872 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 16:43:23,873 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:23,873 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326163453] [2021-07-09 16:43:23,873 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326163453] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:23,873 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:23,873 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:43:23,873 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621162380] [2021-07-09 16:43:23,873 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:43:23,873 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:23,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:43:23,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:43:23,874 INFO L87 Difference]: Start difference. First operand 43165 states and 181410 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 16:43:24,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:24,514 INFO L93 Difference]: Finished difference Result 46201 states and 189818 transitions. [2021-07-09 16:43:24,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-07-09 16:43:24,515 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 16:43:24,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:24,649 INFO L225 Difference]: With dead ends: 46201 [2021-07-09 16:43:24,649 INFO L226 Difference]: Without dead ends: 32761 [2021-07-09 16:43:24,649 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 62.4ms TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2021-07-09 16:43:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32761 states. [2021-07-09 16:43:25,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32761 to 32761. [2021-07-09 16:43:25,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32761 states, 32760 states have (on average 4.068681318681318) internal successors, (133290), 32760 states have internal predecessors, (133290), 0 states have call successors, (0), 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 16:43:25,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32761 states to 32761 states and 133290 transitions. [2021-07-09 16:43:25,862 INFO L78 Accepts]: Start accepts. Automaton has 32761 states and 133290 transitions. Word has length 89 [2021-07-09 16:43:25,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:25,862 INFO L482 AbstractCegarLoop]: Abstraction has 32761 states and 133290 transitions. [2021-07-09 16:43:25,863 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 16:43:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 32761 states and 133290 transitions. [2021-07-09 16:43:25,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2021-07-09 16:43:25,923 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:25,923 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 16:43:25,924 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-07-09 16:43:25,924 INFO L430 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:25,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:25,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1135995549, now seen corresponding path program 1 times [2021-07-09 16:43:25,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:25,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114854226] [2021-07-09 16:43:25,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:25,980 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 16:43:25,980 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:25,980 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114854226] [2021-07-09 16:43:25,980 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114854226] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:25,980 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:25,980 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-07-09 16:43:25,980 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116915513] [2021-07-09 16:43:25,981 INFO L462 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-07-09 16:43:25,981 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:25,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-07-09 16:43:25,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-07-09 16:43:25,981 INFO L87 Difference]: Start difference. First operand 32761 states and 133290 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 16:43:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:26,586 INFO L93 Difference]: Finished difference Result 52207 states and 210170 transitions. [2021-07-09 16:43:26,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-07-09 16:43:26,587 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 16:43:26,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:26,718 INFO L225 Difference]: With dead ends: 52207 [2021-07-09 16:43:26,718 INFO L226 Difference]: Without dead ends: 34165 [2021-07-09 16:43:26,719 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 58.1ms TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:43:26,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34165 states. [2021-07-09 16:43:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34165 to 31789. [2021-07-09 16:43:27,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31789 states, 31788 states have (on average 3.986221215553039) internal successors, (126714), 31788 states have internal predecessors, (126714), 0 states have call successors, (0), 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 16:43:27,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31789 states to 31789 states and 126714 transitions. [2021-07-09 16:43:27,627 INFO L78 Accepts]: Start accepts. Automaton has 31789 states and 126714 transitions. Word has length 91 [2021-07-09 16:43:27,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:27,627 INFO L482 AbstractCegarLoop]: Abstraction has 31789 states and 126714 transitions. [2021-07-09 16:43:27,627 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 16:43:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 31789 states and 126714 transitions. [2021-07-09 16:43:27,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2021-07-09 16:43:27,688 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:27,688 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 16:43:27,688 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-07-09 16:43:27,688 INFO L430 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:27,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:27,688 INFO L82 PathProgramCache]: Analyzing trace with hash -2147455617, now seen corresponding path program 1 times [2021-07-09 16:43:27,688 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:27,689 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489679559] [2021-07-09 16:43:27,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:27,759 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 16:43:27,759 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:27,759 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489679559] [2021-07-09 16:43:27,760 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489679559] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:27,760 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:27,760 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-07-09 16:43:27,760 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025636701] [2021-07-09 16:43:27,760 INFO L462 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-07-09 16:43:27,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:27,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-07-09 16:43:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2021-07-09 16:43:27,761 INFO L87 Difference]: Start difference. First operand 31789 states and 126714 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 16:43:28,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:28,249 INFO L93 Difference]: Finished difference Result 28873 states and 112719 transitions. [2021-07-09 16:43:28,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-07-09 16:43:28,250 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 16:43:28,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:28,319 INFO L225 Difference]: With dead ends: 28873 [2021-07-09 16:43:28,319 INFO L226 Difference]: Without dead ends: 20845 [2021-07-09 16:43:28,320 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 85.9ms TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2021-07-09 16:43:28,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20845 states. [2021-07-09 16:43:28,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20845 to 20845. [2021-07-09 16:43:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20845 states, 20844 states have (on average 3.865284974093264) internal successors, (80568), 20844 states have internal predecessors, (80568), 0 states have call successors, (0), 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 16:43:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20845 states to 20845 states and 80568 transitions. [2021-07-09 16:43:29,000 INFO L78 Accepts]: Start accepts. Automaton has 20845 states and 80568 transitions. Word has length 92 [2021-07-09 16:43:29,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:29,000 INFO L482 AbstractCegarLoop]: Abstraction has 20845 states and 80568 transitions. [2021-07-09 16:43:29,000 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 16:43:29,000 INFO L276 IsEmpty]: Start isEmpty. Operand 20845 states and 80568 transitions. [2021-07-09 16:43:29,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-07-09 16:43:29,038 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:29,038 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 16:43:29,039 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-07-09 16:43:29,039 INFO L430 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:29,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:29,039 INFO L82 PathProgramCache]: Analyzing trace with hash -806660607, now seen corresponding path program 1 times [2021-07-09 16:43:29,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:29,039 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510414615] [2021-07-09 16:43:29,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:29,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:29,110 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 16:43:29,110 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:29,110 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510414615] [2021-07-09 16:43:29,110 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510414615] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:29,111 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:29,111 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:43:29,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143036692] [2021-07-09 16:43:29,111 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:43:29,111 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:29,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:43:29,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:43:29,111 INFO L87 Difference]: Start difference. First operand 20845 states and 80568 transitions. Second operand has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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 16:43:29,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:29,316 INFO L93 Difference]: Finished difference Result 28861 states and 111139 transitions. [2021-07-09 16:43:29,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:43:29,316 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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 16:43:29,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:29,357 INFO L225 Difference]: With dead ends: 28861 [2021-07-09 16:43:29,357 INFO L226 Difference]: Without dead ends: 13595 [2021-07-09 16:43:29,357 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 54.0ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:43:29,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13595 states. [2021-07-09 16:43:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13595 to 13595. [2021-07-09 16:43:29,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13595 states, 13594 states have (on average 3.7831396204207737) internal successors, (51428), 13594 states have internal predecessors, (51428), 0 states have call successors, (0), 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 16:43:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13595 states to 13595 states and 51428 transitions. [2021-07-09 16:43:29,858 INFO L78 Accepts]: Start accepts. Automaton has 13595 states and 51428 transitions. Word has length 96 [2021-07-09 16:43:29,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:29,858 INFO L482 AbstractCegarLoop]: Abstraction has 13595 states and 51428 transitions. [2021-07-09 16:43:29,858 INFO L483 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 13.714285714285714) internal successors, (96), 7 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 16:43:29,859 INFO L276 IsEmpty]: Start isEmpty. Operand 13595 states and 51428 transitions. [2021-07-09 16:43:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2021-07-09 16:43:29,885 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:29,885 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 16:43:29,885 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-07-09 16:43:29,885 INFO L430 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:29,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:29,886 INFO L82 PathProgramCache]: Analyzing trace with hash -753648447, now seen corresponding path program 2 times [2021-07-09 16:43:29,886 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:29,887 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373413098] [2021-07-09 16:43:29,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:29,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:30,040 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 16:43:30,040 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:30,040 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373413098] [2021-07-09 16:43:30,042 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373413098] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:30,042 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:30,042 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-07-09 16:43:30,042 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564342322] [2021-07-09 16:43:30,042 INFO L462 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-07-09 16:43:30,042 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:30,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-07-09 16:43:30,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2021-07-09 16:43:30,043 INFO L87 Difference]: Start difference. First operand 13595 states and 51428 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 16:43:30,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:30,238 INFO L93 Difference]: Finished difference Result 11165 states and 41627 transitions. [2021-07-09 16:43:30,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2021-07-09 16:43:30,239 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 16:43:30,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:30,254 INFO L225 Difference]: With dead ends: 11165 [2021-07-09 16:43:30,254 INFO L226 Difference]: Without dead ends: 5279 [2021-07-09 16:43:30,254 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 107.4ms TimeCoverageRelationStatistics Valid=76, Invalid=196, Unknown=0, NotChecked=0, Total=272 [2021-07-09 16:43:30,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2021-07-09 16:43:30,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 5279. [2021-07-09 16:43:30,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 5278 states have (on average 3.6290261462675257) internal successors, (19154), 5278 states have internal predecessors, (19154), 0 states have call successors, (0), 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 16:43:30,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 19154 transitions. [2021-07-09 16:43:30,370 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 19154 transitions. Word has length 96 [2021-07-09 16:43:30,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:30,371 INFO L482 AbstractCegarLoop]: Abstraction has 5279 states and 19154 transitions. [2021-07-09 16:43:30,371 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 16:43:30,372 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 19154 transitions. [2021-07-09 16:43:30,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-09 16:43:30,389 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:30,389 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 16:43:30,389 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-07-09 16:43:30,389 INFO L430 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:30,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:30,389 INFO L82 PathProgramCache]: Analyzing trace with hash 703941395, now seen corresponding path program 1 times [2021-07-09 16:43:30,390 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:30,390 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407012476] [2021-07-09 16:43:30,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-07-09 16:43:30,511 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 16:43:30,511 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-07-09 16:43:30,511 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407012476] [2021-07-09 16:43:30,511 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407012476] provided 1 perfect and 0 imperfect interpolant sequences [2021-07-09 16:43:30,511 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-07-09 16:43:30,511 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-07-09 16:43:30,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494547971] [2021-07-09 16:43:30,512 INFO L462 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-07-09 16:43:30,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-07-09 16:43:30,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-07-09 16:43:30,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-07-09 16:43:30,514 INFO L87 Difference]: Start difference. First operand 5279 states and 19154 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 16:43:30,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-07-09 16:43:30,769 INFO L93 Difference]: Finished difference Result 7457 states and 27170 transitions. [2021-07-09 16:43:30,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-07-09 16:43:30,785 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 16:43:30,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-07-09 16:43:30,792 INFO L225 Difference]: With dead ends: 7457 [2021-07-09 16:43:30,792 INFO L226 Difference]: Without dead ends: 2687 [2021-07-09 16:43:30,793 INFO L764 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 63.2ms TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2021-07-09 16:43:30,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2021-07-09 16:43:30,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2687. [2021-07-09 16:43:30,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2687 states, 2686 states have (on average 3.5323901712583767) internal successors, (9488), 2686 states have internal predecessors, (9488), 0 states have call successors, (0), 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 16:43:30,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2687 states to 2687 states and 9488 transitions. [2021-07-09 16:43:30,851 INFO L78 Accepts]: Start accepts. Automaton has 2687 states and 9488 transitions. Word has length 100 [2021-07-09 16:43:30,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-07-09 16:43:30,852 INFO L482 AbstractCegarLoop]: Abstraction has 2687 states and 9488 transitions. [2021-07-09 16:43:30,852 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 16:43:30,852 INFO L276 IsEmpty]: Start isEmpty. Operand 2687 states and 9488 transitions. [2021-07-09 16:43:30,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2021-07-09 16:43:30,856 INFO L500 BasicCegarLoop]: Found error trace [2021-07-09 16:43:30,856 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 16:43:30,856 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-07-09 16:43:30,856 INFO L430 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-07-09 16:43:30,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-07-09 16:43:30,856 INFO L82 PathProgramCache]: Analyzing trace with hash -64509197, now seen corresponding path program 2 times [2021-07-09 16:43:30,857 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-07-09 16:43:30,857 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22960798] [2021-07-09 16:43:30,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-07-09 16:43:30,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:43:30,882 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:43:30,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-07-09 16:43:30,972 INFO L223 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-07-09 16:43:31,016 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-07-09 16:43:31,016 INFO L609 BasicCegarLoop]: Counterexample might be feasible [2021-07-09 16:43:31,017 WARN L519 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-07-09 16:43:31,018 INFO L301 ceAbstractionStarter]: Result for error location ULTIMATE.start was UNSAFE (1/2) [2021-07-09 16:43:31,020 INFO L247 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2021-07-09 16:43:31,145 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.07 04:43:31 BasicIcfg [2021-07-09 16:43:31,145 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-07-09 16:43:31,146 INFO L168 Benchmark]: Toolchain (without parser) took 56464.73 ms. Allocated memory was 197.1 MB in the beginning and 8.0 GB in the end (delta: 7.8 GB). Free memory was 159.5 MB in the beginning and 7.1 GB in the end (delta: -7.0 GB). Peak memory consumption was 803.2 MB. Max. memory is 8.0 GB. [2021-07-09 16:43:31,146 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 197.1 MB. Free memory is still 177.6 MB. There was no memory consumed. Max. memory is 8.0 GB. [2021-07-09 16:43:31,147 INFO L168 Benchmark]: CACSL2BoogieTranslator took 427.76 ms. Allocated memory is still 197.1 MB. Free memory was 159.3 MB in the beginning and 167.0 MB in the end (delta: -7.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. [2021-07-09 16:43:31,147 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.88 ms. Allocated memory is still 197.1 MB. Free memory was 167.0 MB in the beginning and 163.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. [2021-07-09 16:43:31,147 INFO L168 Benchmark]: Boogie Preprocessor took 33.36 ms. Allocated memory is still 197.1 MB. Free memory was 163.3 MB in the beginning and 161.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. [2021-07-09 16:43:31,147 INFO L168 Benchmark]: RCFGBuilder took 1295.72 ms. Allocated memory was 197.1 MB in the beginning and 251.7 MB in the end (delta: 54.5 MB). Free memory was 161.2 MB in the beginning and 222.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 102.0 MB. Max. memory is 8.0 GB. [2021-07-09 16:43:31,147 INFO L168 Benchmark]: TraceAbstraction took 54647.89 ms. Allocated memory was 251.7 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 222.2 MB in the beginning and 7.1 GB in the end (delta: -6.9 GB). Peak memory consumption was 810.7 MB. Max. memory is 8.0 GB. [2021-07-09 16:43:31,152 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.12 ms. Allocated memory is still 197.1 MB. Free memory is still 177.6 MB. There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 427.76 ms. Allocated memory is still 197.1 MB. Free memory was 159.3 MB in the beginning and 167.0 MB in the end (delta: -7.6 MB). Peak memory consumption was 12.6 MB. Max. memory is 8.0 GB. * Boogie Procedure Inliner took 55.88 ms. Allocated memory is still 197.1 MB. Free memory was 167.0 MB in the beginning and 163.3 MB in the end (delta: 3.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 33.36 ms. Allocated memory is still 197.1 MB. Free memory was 163.3 MB in the beginning and 161.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 8.0 GB. * RCFGBuilder took 1295.72 ms. Allocated memory was 197.1 MB in the beginning and 251.7 MB in the end (delta: 54.5 MB). Free memory was 161.2 MB in the beginning and 222.7 MB in the end (delta: -61.6 MB). Peak memory consumption was 102.0 MB. Max. memory is 8.0 GB. * TraceAbstraction took 54647.89 ms. Allocated memory was 251.7 MB in the beginning and 8.0 GB in the end (delta: 7.7 GB). Free memory was 222.2 MB in the beginning and 7.1 GB in the end (delta: -6.9 GB). Peak memory consumption was 810.7 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - 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}, 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}, 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}, 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}, 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}, 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}, 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] [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=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=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] [L775] 2 __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] 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] 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] 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] 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] 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] 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=255, 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=255, 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=255, 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: 54437.8ms, OverallIterations: 18, TraceHistogramMax: 1, EmptinessCheckTime: 2223.9ms, AutomataDifference: 17636.6ms, DeadEndRemovalTime: 0.0ms, HoareAnnotationTime: 0.0ms, InitialAbstractionConstructionTime: 1837.3ms, PartialOrderReductionTime: 0.0ms, HoareTripleCheckerStatistics: 3264 SDtfs, 4955 SDslu, 13972 SDs, 0 SdLazy, 1321 SolverSat, 271 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1230.2ms Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 253 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 219 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 2423.8ms Time, 0.0ms BasicInterpolantAutomatonTime, BiggestAbstraction: size=72173occurred in iteration=0, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0ms DumpTime, AutomataMinimizationStatistics: 28877.2ms AutomataMinimizationTime, 17 MinimizatonAttempts, 30208 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 61.2ms SsaConstructionTime, 617.1ms SatisfiabilityAnalysisTime, 2618.2ms InterpolantComputationTime, 1613 NumberOfCodeBlocks, 1613 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1496 ConstructedInterpolants, 0 QuantifiedInterpolants, 7754 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...