/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-NoLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-60729f1 [2020-11-11 17:56:22,676 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-11 17:56:22,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-11 17:56:22,737 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-11 17:56:22,738 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-11 17:56:22,742 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-11 17:56:22,746 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-11 17:56:22,755 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-11 17:56:22,759 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-11 17:56:22,766 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-11 17:56:22,767 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-11 17:56:22,769 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-11 17:56:22,769 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-11 17:56:22,772 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-11 17:56:22,774 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-11 17:56:22,776 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-11 17:56:22,777 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-11 17:56:22,781 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-11 17:56:22,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-11 17:56:22,796 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-11 17:56:22,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-11 17:56:22,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-11 17:56:22,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-11 17:56:22,804 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-11 17:56:22,812 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-11 17:56:22,813 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-11 17:56:22,813 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-11 17:56:22,815 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-11 17:56:22,816 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-11 17:56:22,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-11 17:56:22,817 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-11 17:56:22,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-11 17:56:22,820 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-11 17:56:22,821 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-11 17:56:22,822 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-11 17:56:22,822 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-11 17:56:22,823 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-11 17:56:22,824 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-11 17:56:22,824 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-11 17:56:22,825 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-11 17:56:22,826 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-11 17:56:22,827 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 [2020-11-11 17:56:22,883 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-11 17:56:22,883 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-11 17:56:22,888 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-11 17:56:22,888 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-11 17:56:22,888 INFO L138 SettingsManager]: * Use SBE=true [2020-11-11 17:56:22,888 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-11 17:56:22,889 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-11 17:56:22,889 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-11 17:56:22,889 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-11 17:56:22,890 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-11 17:56:22,891 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-11 17:56:22,891 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-11 17:56:22,891 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-11 17:56:22,892 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-11 17:56:22,892 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-11 17:56:22,892 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-11 17:56:22,892 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-11 17:56:22,892 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-11 17:56:22,893 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-11 17:56:22,893 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-11 17:56:22,893 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-11 17:56:22,894 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-11 17:56:22,894 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-11 17:56:22,894 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-11 17:56:22,894 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-11 17:56:22,895 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-11 17:56:22,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-11 17:56:22,895 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-11-11 17:56:22,895 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-11 17:56:22,895 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 [2020-11-11 17:56:23,309 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-11 17:56:23,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-11 17:56:23,349 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-11 17:56:23,351 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-11 17:56:23,351 INFO L275 PluginConnector]: CDTParser initialized [2020-11-11 17:56:23,352 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2020-11-11 17:56:23,429 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004d9578/41f9921a87cd4fe689d2761a3b22d7ae/FLAG308f7f5c0 [2020-11-11 17:56:24,189 INFO L306 CDTParser]: Found 1 translation units. [2020-11-11 17:56:24,190 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix056_pso.opt.i [2020-11-11 17:56:24,208 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004d9578/41f9921a87cd4fe689d2761a3b22d7ae/FLAG308f7f5c0 [2020-11-11 17:56:24,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c004d9578/41f9921a87cd4fe689d2761a3b22d7ae [2020-11-11 17:56:24,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-11 17:56:24,463 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-11-11 17:56:24,468 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-11 17:56:24,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-11 17:56:24,472 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-11 17:56:24,473 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:56:24" (1/1) ... [2020-11-11 17:56:24,477 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a14278f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:24, skipping insertion in model container [2020-11-11 17:56:24,478 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 05:56:24" (1/1) ... [2020-11-11 17:56:24,486 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-11 17:56:24,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-11 17:56:25,140 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 17:56:25,156 INFO L203 MainTranslator]: Completed pre-run [2020-11-11 17:56:25,278 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-11 17:56:25,433 INFO L208 MainTranslator]: Completed translation [2020-11-11 17:56:25,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25 WrapperNode [2020-11-11 17:56:25,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-11 17:56:25,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-11 17:56:25,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-11 17:56:25,436 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-11 17:56:25,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,463 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-11 17:56:25,501 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-11 17:56:25,501 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-11 17:56:25,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-11 17:56:25,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,527 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,531 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (1/1) ... [2020-11-11 17:56:25,541 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-11 17:56:25,542 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-11 17:56:25,542 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-11 17:56:25,543 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-11 17:56:25,543 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (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 [2020-11-11 17:56:25,660 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-11 17:56:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-11-11 17:56:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-11 17:56:25,661 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-11 17:56:25,662 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-11-11 17:56:25,662 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-11-11 17:56:25,664 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-11-11 17:56:25,665 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-11-11 17:56:25,665 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-11-11 17:56:25,666 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-11-11 17:56:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-11 17:56:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-11-11 17:56:25,667 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-11 17:56:25,667 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-11 17:56:25,670 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-11-11 17:56:27,901 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-11 17:56:27,902 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-11-11 17:56:27,904 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:56:27 BoogieIcfgContainer [2020-11-11 17:56:27,904 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-11 17:56:27,906 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-11 17:56:27,906 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-11 17:56:27,910 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-11 17:56:27,910 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 05:56:24" (1/3) ... [2020-11-11 17:56:27,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7dbce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:56:27, skipping insertion in model container [2020-11-11 17:56:27,911 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 05:56:25" (2/3) ... [2020-11-11 17:56:27,911 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e7dbce3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 05:56:27, skipping insertion in model container [2020-11-11 17:56:27,912 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 05:56:27" (3/3) ... [2020-11-11 17:56:27,913 INFO L111 eAbstractionObserver]: Analyzing ICFG mix056_pso.opt.i [2020-11-11 17:56:27,932 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-11-11 17:56:27,932 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-11 17:56:27,936 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-11-11 17:56:27,937 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-11-11 17:56:27,975 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,976 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,976 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,977 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,977 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,978 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,978 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,978 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,979 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,980 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,980 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,980 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,981 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,982 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,983 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,984 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,984 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,985 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,985 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,986 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,986 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,987 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,987 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,988 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,988 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,989 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,989 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,990 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,991 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,992 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,993 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,995 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,996 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,996 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,996 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,997 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,997 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:27,998 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,004 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,004 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,005 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,006 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,007 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,007 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,008 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-11-11 17:56:28,010 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-11-11 17:56:28,023 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-11-11 17:56:28,047 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-11 17:56:28,047 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-11 17:56:28,047 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-11 17:56:28,047 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-11 17:56:28,047 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-11 17:56:28,047 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-11 17:56:28,048 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-11 17:56:28,048 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-11 17:56:28,061 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 107 places, 100 transitions, 215 flow [2020-11-11 17:56:29,245 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14905 states, 14901 states have (on average 3.6664653378967853) internal successors, (54634), 14904 states have internal predecessors, (54634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:29,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 14905 states, 14901 states have (on average 3.6664653378967853) internal successors, (54634), 14904 states have internal predecessors, (54634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:29,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2020-11-11 17:56:29,301 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:29,302 INFO L494 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] [2020-11-11 17:56:29,302 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:29,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:29,311 INFO L82 PathProgramCache]: Analyzing trace with hash 419918898, now seen corresponding path program 1 times [2020-11-11 17:56:29,321 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:29,322 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571339917] [2020-11-11 17:56:29,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:29,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:29,749 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571339917] [2020-11-11 17:56:29,750 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:29,750 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-11-11 17:56:29,751 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064156832] [2020-11-11 17:56:29,757 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-11 17:56:29,757 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:29,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-11 17:56:29,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 17:56:29,805 INFO L87 Difference]: Start difference. First operand has 14905 states, 14901 states have (on average 3.6664653378967853) internal successors, (54634), 14904 states have internal predecessors, (54634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:30,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:30,166 INFO L93 Difference]: Finished difference Result 12385 states and 43885 transitions. [2020-11-11 17:56:30,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-11 17:56:30,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 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 47 [2020-11-11 17:56:30,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:30,284 INFO L225 Difference]: With dead ends: 12385 [2020-11-11 17:56:30,284 INFO L226 Difference]: Without dead ends: 7457 [2020-11-11 17:56:30,286 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-11 17:56:30,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7457 states. [2020-11-11 17:56:30,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7457 to 7457. [2020-11-11 17:56:30,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7457 states, 7456 states have (on average 3.5017435622317596) internal successors, (26109), 7456 states have internal predecessors, (26109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7457 states to 7457 states and 26109 transitions. [2020-11-11 17:56:30,876 INFO L78 Accepts]: Start accepts. Automaton has 7457 states and 26109 transitions. Word has length 47 [2020-11-11 17:56:30,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:30,878 INFO L481 AbstractCegarLoop]: Abstraction has 7457 states and 26109 transitions. [2020-11-11 17:56:30,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:30,879 INFO L276 IsEmpty]: Start isEmpty. Operand 7457 states and 26109 transitions. [2020-11-11 17:56:30,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2020-11-11 17:56:30,900 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:30,900 INFO L494 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] [2020-11-11 17:56:30,901 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-11 17:56:30,901 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:30,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:30,903 INFO L82 PathProgramCache]: Analyzing trace with hash -385930794, now seen corresponding path program 1 times [2020-11-11 17:56:30,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:30,903 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814484513] [2020-11-11 17:56:30,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:31,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:31,450 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814484513] [2020-11-11 17:56:31,450 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:31,450 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:56:31,451 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106491280] [2020-11-11 17:56:31,453 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:56:31,453 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:31,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:56:31,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:56:31,455 INFO L87 Difference]: Start difference. First operand 7457 states and 26109 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:31,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:31,715 INFO L93 Difference]: Finished difference Result 8865 states and 30685 transitions. [2020-11-11 17:56:31,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:56:31,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 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 60 [2020-11-11 17:56:31,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:31,799 INFO L225 Difference]: With dead ends: 8865 [2020-11-11 17:56:31,799 INFO L226 Difference]: Without dead ends: 7073 [2020-11-11 17:56:31,800 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:56:31,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7073 states. [2020-11-11 17:56:32,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7073 to 7073. [2020-11-11 17:56:32,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7073 states, 7072 states have (on average 3.4814762443438916) internal successors, (24621), 7072 states have internal predecessors, (24621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:32,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7073 states to 7073 states and 24621 transitions. [2020-11-11 17:56:32,188 INFO L78 Accepts]: Start accepts. Automaton has 7073 states and 24621 transitions. Word has length 60 [2020-11-11 17:56:32,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:32,189 INFO L481 AbstractCegarLoop]: Abstraction has 7073 states and 24621 transitions. [2020-11-11 17:56:32,189 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 7073 states and 24621 transitions. [2020-11-11 17:56:32,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2020-11-11 17:56:32,211 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:32,212 INFO L494 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] [2020-11-11 17:56:32,212 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-11 17:56:32,212 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:32,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:32,216 INFO L82 PathProgramCache]: Analyzing trace with hash -972322921, now seen corresponding path program 1 times [2020-11-11 17:56:32,216 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:32,217 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461081072] [2020-11-11 17:56:32,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:32,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:32,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:32,633 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461081072] [2020-11-11 17:56:32,633 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:32,633 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 17:56:32,634 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912065275] [2020-11-11 17:56:32,634 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 17:56:32,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:32,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 17:56:32,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 17:56:32,642 INFO L87 Difference]: Start difference. First operand 7073 states and 24621 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:33,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:33,139 INFO L93 Difference]: Finished difference Result 8475 states and 29209 transitions. [2020-11-11 17:56:33,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:56:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 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 62 [2020-11-11 17:56:33,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:33,173 INFO L225 Difference]: With dead ends: 8475 [2020-11-11 17:56:33,173 INFO L226 Difference]: Without dead ends: 6875 [2020-11-11 17:56:33,174 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2020-11-11 17:56:33,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6875 states. [2020-11-11 17:56:33,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6875 to 6833. [2020-11-11 17:56:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6833 states, 6832 states have (on average 3.4702868852459017) internal successors, (23709), 6832 states have internal predecessors, (23709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:33,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6833 states to 6833 states and 23709 transitions. [2020-11-11 17:56:33,469 INFO L78 Accepts]: Start accepts. Automaton has 6833 states and 23709 transitions. Word has length 62 [2020-11-11 17:56:33,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:33,469 INFO L481 AbstractCegarLoop]: Abstraction has 6833 states and 23709 transitions. [2020-11-11 17:56:33,470 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 8 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:33,471 INFO L276 IsEmpty]: Start isEmpty. Operand 6833 states and 23709 transitions. [2020-11-11 17:56:33,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-11-11 17:56:33,486 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:33,487 INFO L494 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] [2020-11-11 17:56:33,487 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-11 17:56:33,487 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:33,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:33,488 INFO L82 PathProgramCache]: Analyzing trace with hash 156129175, now seen corresponding path program 1 times [2020-11-11 17:56:33,488 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:33,488 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114319948] [2020-11-11 17:56:33,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:33,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:33,895 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114319948] [2020-11-11 17:56:33,896 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:33,896 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2020-11-11 17:56:33,896 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901309068] [2020-11-11 17:56:33,897 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-11 17:56:33,897 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:33,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-11 17:56:33,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2020-11-11 17:56:33,898 INFO L87 Difference]: Start difference. First operand 6833 states and 23709 transitions. Second operand has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:34,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:34,263 INFO L93 Difference]: Finished difference Result 7393 states and 25407 transitions. [2020-11-11 17:56:34,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-11 17:56:34,264 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 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 63 [2020-11-11 17:56:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:34,293 INFO L225 Difference]: With dead ends: 7393 [2020-11-11 17:56:34,294 INFO L226 Difference]: Without dead ends: 6273 [2020-11-11 17:56:34,294 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2020-11-11 17:56:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6273 states. [2020-11-11 17:56:34,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6273 to 6273. [2020-11-11 17:56:34,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6273 states, 6272 states have (on average 3.4536033163265305) internal successors, (21661), 6272 states have internal predecessors, (21661), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:34,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6273 states to 6273 states and 21661 transitions. [2020-11-11 17:56:34,606 INFO L78 Accepts]: Start accepts. Automaton has 6273 states and 21661 transitions. Word has length 63 [2020-11-11 17:56:34,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:34,607 INFO L481 AbstractCegarLoop]: Abstraction has 6273 states and 21661 transitions. [2020-11-11 17:56:34,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 7.0) internal successors, (63), 9 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:34,607 INFO L276 IsEmpty]: Start isEmpty. Operand 6273 states and 21661 transitions. [2020-11-11 17:56:34,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-11-11 17:56:34,625 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:34,625 INFO L494 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] [2020-11-11 17:56:34,626 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-11 17:56:34,626 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:34,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:34,627 INFO L82 PathProgramCache]: Analyzing trace with hash -235403787, now seen corresponding path program 1 times [2020-11-11 17:56:34,627 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:34,627 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177293822] [2020-11-11 17:56:34,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:34,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:34,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:34,997 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177293822] [2020-11-11 17:56:34,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:34,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 17:56:34,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157193660] [2020-11-11 17:56:34,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 17:56:34,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:34,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 17:56:35,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2020-11-11 17:56:35,000 INFO L87 Difference]: Start difference. First operand 6273 states and 21661 transitions. Second operand has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:35,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:35,391 INFO L93 Difference]: Finished difference Result 7233 states and 24719 transitions. [2020-11-11 17:56:35,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:56:35,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 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 64 [2020-11-11 17:56:35,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:35,419 INFO L225 Difference]: With dead ends: 7233 [2020-11-11 17:56:35,419 INFO L226 Difference]: Without dead ends: 6033 [2020-11-11 17:56:35,420 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2020-11-11 17:56:35,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6033 states. [2020-11-11 17:56:35,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6033 to 6033. [2020-11-11 17:56:35,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6033 states, 6032 states have (on average 3.439820954907162) internal successors, (20749), 6032 states have internal predecessors, (20749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:35,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6033 states to 6033 states and 20749 transitions. [2020-11-11 17:56:35,717 INFO L78 Accepts]: Start accepts. Automaton has 6033 states and 20749 transitions. Word has length 64 [2020-11-11 17:56:35,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:35,717 INFO L481 AbstractCegarLoop]: Abstraction has 6033 states and 20749 transitions. [2020-11-11 17:56:35,717 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.4) internal successors, (64), 10 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:35,718 INFO L276 IsEmpty]: Start isEmpty. Operand 6033 states and 20749 transitions. [2020-11-11 17:56:35,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-11 17:56:35,733 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:35,733 INFO L494 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] [2020-11-11 17:56:35,733 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-11 17:56:35,733 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:35,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:35,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1875301877, now seen corresponding path program 1 times [2020-11-11 17:56:35,734 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:35,734 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315627214] [2020-11-11 17:56:35,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:36,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:36,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315627214] [2020-11-11 17:56:36,053 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:36,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 17:56:36,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503651840] [2020-11-11 17:56:36,054 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 17:56:36,054 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:36,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 17:56:36,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-11-11 17:56:36,055 INFO L87 Difference]: Start difference. First operand 6033 states and 20749 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:36,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:36,487 INFO L93 Difference]: Finished difference Result 6999 states and 23943 transitions. [2020-11-11 17:56:36,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 17:56:36,488 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2020-11-11 17:56:36,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:36,518 INFO L225 Difference]: With dead ends: 6999 [2020-11-11 17:56:36,523 INFO L226 Difference]: Without dead ends: 6159 [2020-11-11 17:56:36,524 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2020-11-11 17:56:36,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6159 states. [2020-11-11 17:56:36,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6159 to 6159. [2020-11-11 17:56:36,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6159 states, 6158 states have (on average 3.4438129262747643) internal successors, (21207), 6158 states have internal predecessors, (21207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:36,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6159 states to 6159 states and 21207 transitions. [2020-11-11 17:56:36,854 INFO L78 Accepts]: Start accepts. Automaton has 6159 states and 21207 transitions. Word has length 65 [2020-11-11 17:56:36,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:36,855 INFO L481 AbstractCegarLoop]: Abstraction has 6159 states and 21207 transitions. [2020-11-11 17:56:36,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:36,855 INFO L276 IsEmpty]: Start isEmpty. Operand 6159 states and 21207 transitions. [2020-11-11 17:56:36,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-11 17:56:36,870 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:36,871 INFO L494 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] [2020-11-11 17:56:36,871 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-11 17:56:36,872 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:36,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:36,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1948581891, now seen corresponding path program 2 times [2020-11-11 17:56:36,873 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:36,874 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414787556] [2020-11-11 17:56:36,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:36,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:37,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:37,207 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414787556] [2020-11-11 17:56:37,207 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:37,207 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-11-11 17:56:37,207 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039442635] [2020-11-11 17:56:37,208 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-11 17:56:37,208 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:37,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-11 17:56:37,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:56:37,210 INFO L87 Difference]: Start difference. First operand 6159 states and 21207 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:37,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:37,855 INFO L93 Difference]: Finished difference Result 8147 states and 27993 transitions. [2020-11-11 17:56:37,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-11 17:56:37,855 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2020-11-11 17:56:37,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:37,895 INFO L225 Difference]: With dead ends: 8147 [2020-11-11 17:56:37,895 INFO L226 Difference]: Without dead ends: 7083 [2020-11-11 17:56:37,896 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2020-11-11 17:56:37,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7083 states. [2020-11-11 17:56:38,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7083 to 6593. [2020-11-11 17:56:38,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6593 states, 6592 states have (on average 3.4476638349514563) internal successors, (22727), 6592 states have internal predecessors, (22727), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 22727 transitions. [2020-11-11 17:56:38,140 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 22727 transitions. Word has length 65 [2020-11-11 17:56:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:38,140 INFO L481 AbstractCegarLoop]: Abstraction has 6593 states and 22727 transitions. [2020-11-11 17:56:38,140 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:38,140 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 22727 transitions. [2020-11-11 17:56:38,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-11-11 17:56:38,155 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:38,155 INFO L494 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] [2020-11-11 17:56:38,155 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-11 17:56:38,155 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:38,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:38,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1290025549, now seen corresponding path program 3 times [2020-11-11 17:56:38,156 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:38,157 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409385662] [2020-11-11 17:56:38,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:38,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:38,464 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409385662] [2020-11-11 17:56:38,465 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:38,465 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-11-11 17:56:38,465 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385454873] [2020-11-11 17:56:38,465 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-11-11 17:56:38,465 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:38,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-11-11 17:56:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2020-11-11 17:56:38,466 INFO L87 Difference]: Start difference. First operand 6593 states and 22727 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:39,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:39,015 INFO L93 Difference]: Finished difference Result 7881 states and 26995 transitions. [2020-11-11 17:56:39,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-11 17:56:39,016 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 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 65 [2020-11-11 17:56:39,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:39,047 INFO L225 Difference]: With dead ends: 7881 [2020-11-11 17:56:39,047 INFO L226 Difference]: Without dead ends: 6929 [2020-11-11 17:56:39,048 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2020-11-11 17:56:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6929 states. [2020-11-11 17:56:39,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6929 to 6593. [2020-11-11 17:56:39,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6593 states, 6592 states have (on average 3.4370449029126213) internal successors, (22657), 6592 states have internal predecessors, (22657), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:39,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6593 states to 6593 states and 22657 transitions. [2020-11-11 17:56:39,317 INFO L78 Accepts]: Start accepts. Automaton has 6593 states and 22657 transitions. Word has length 65 [2020-11-11 17:56:39,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:39,318 INFO L481 AbstractCegarLoop]: Abstraction has 6593 states and 22657 transitions. [2020-11-11 17:56:39,318 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:39,318 INFO L276 IsEmpty]: Start isEmpty. Operand 6593 states and 22657 transitions. [2020-11-11 17:56:39,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-11 17:56:39,340 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:39,340 INFO L494 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] [2020-11-11 17:56:39,340 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-11 17:56:39,340 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:39,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:39,341 INFO L82 PathProgramCache]: Analyzing trace with hash -793193582, now seen corresponding path program 1 times [2020-11-11 17:56:39,341 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:39,342 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850914628] [2020-11-11 17:56:39,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:39,759 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850914628] [2020-11-11 17:56:39,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:39,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 17:56:39,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157502314] [2020-11-11 17:56:39,760 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 17:56:39,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:39,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 17:56:39,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2020-11-11 17:56:39,761 INFO L87 Difference]: Start difference. First operand 6593 states and 22657 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:40,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:40,280 INFO L93 Difference]: Finished difference Result 7839 states and 26875 transitions. [2020-11-11 17:56:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-11 17:56:40,282 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2020-11-11 17:56:40,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:40,308 INFO L225 Difference]: With dead ends: 7839 [2020-11-11 17:56:40,308 INFO L226 Difference]: Without dead ends: 7167 [2020-11-11 17:56:40,309 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2020-11-11 17:56:40,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7167 states. [2020-11-11 17:56:40,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7167 to 6719. [2020-11-11 17:56:40,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6719 states, 6718 states have (on average 3.44075617743376) internal successors, (23115), 6718 states have internal predecessors, (23115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:40,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6719 states to 6719 states and 23115 transitions. [2020-11-11 17:56:40,569 INFO L78 Accepts]: Start accepts. Automaton has 6719 states and 23115 transitions. Word has length 66 [2020-11-11 17:56:40,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:40,570 INFO L481 AbstractCegarLoop]: Abstraction has 6719 states and 23115 transitions. [2020-11-11 17:56:40,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:40,570 INFO L276 IsEmpty]: Start isEmpty. Operand 6719 states and 23115 transitions. [2020-11-11 17:56:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-11 17:56:40,591 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:40,591 INFO L494 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] [2020-11-11 17:56:40,591 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-11 17:56:40,592 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:40,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:40,592 INFO L82 PathProgramCache]: Analyzing trace with hash 588164550, now seen corresponding path program 2 times [2020-11-11 17:56:40,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:40,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380347628] [2020-11-11 17:56:40,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:41,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:41,156 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380347628] [2020-11-11 17:56:41,156 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:41,156 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-11-11 17:56:41,157 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157707467] [2020-11-11 17:56:41,157 INFO L461 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-11-11 17:56:41,158 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:41,158 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-11-11 17:56:41,158 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2020-11-11 17:56:41,159 INFO L87 Difference]: Start difference. First operand 6719 states and 23115 transitions. Second operand has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:41,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:41,936 INFO L93 Difference]: Finished difference Result 7727 states and 26394 transitions. [2020-11-11 17:56:41,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-11-11 17:56:41,937 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2020-11-11 17:56:41,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:41,969 INFO L225 Difference]: With dead ends: 7727 [2020-11-11 17:56:41,970 INFO L226 Difference]: Without dead ends: 7055 [2020-11-11 17:56:41,970 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=104, Invalid=276, Unknown=0, NotChecked=0, Total=380 [2020-11-11 17:56:42,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7055 states. [2020-11-11 17:56:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7055 to 6705. [2020-11-11 17:56:42,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6705 states, 6704 states have (on average 3.441974940334129) internal successors, (23075), 6704 states have internal predecessors, (23075), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:42,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6705 states to 6705 states and 23075 transitions. [2020-11-11 17:56:42,247 INFO L78 Accepts]: Start accepts. Automaton has 6705 states and 23075 transitions. Word has length 66 [2020-11-11 17:56:42,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:42,248 INFO L481 AbstractCegarLoop]: Abstraction has 6705 states and 23075 transitions. [2020-11-11 17:56:42,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 13 states, 13 states have (on average 5.076923076923077) internal successors, (66), 13 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:42,248 INFO L276 IsEmpty]: Start isEmpty. Operand 6705 states and 23075 transitions. [2020-11-11 17:56:42,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-11 17:56:42,267 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:42,268 INFO L494 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] [2020-11-11 17:56:42,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-11 17:56:42,268 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:42,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:42,269 INFO L82 PathProgramCache]: Analyzing trace with hash -134095980, now seen corresponding path program 3 times [2020-11-11 17:56:42,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:42,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23287583] [2020-11-11 17:56:42,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:42,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:42,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23287583] [2020-11-11 17:56:42,717 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:42,717 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-11-11 17:56:42,717 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344708215] [2020-11-11 17:56:42,718 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-11 17:56:42,718 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:42,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-11 17:56:42,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2020-11-11 17:56:42,719 INFO L87 Difference]: Start difference. First operand 6705 states and 23075 transitions. Second operand has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:43,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:43,214 INFO L93 Difference]: Finished difference Result 9393 states and 31735 transitions. [2020-11-11 17:56:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-11-11 17:56:43,215 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2020-11-11 17:56:43,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:43,235 INFO L225 Difference]: With dead ends: 9393 [2020-11-11 17:56:43,236 INFO L226 Difference]: Without dead ends: 7153 [2020-11-11 17:56:43,236 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2020-11-11 17:56:43,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7153 states. [2020-11-11 17:56:43,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7153 to 5473. [2020-11-11 17:56:43,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5473 states, 5472 states have (on average 3.3766447368421053) internal successors, (18477), 5472 states have internal predecessors, (18477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5473 states to 5473 states and 18477 transitions. [2020-11-11 17:56:43,463 INFO L78 Accepts]: Start accepts. Automaton has 5473 states and 18477 transitions. Word has length 66 [2020-11-11 17:56:43,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:43,463 INFO L481 AbstractCegarLoop]: Abstraction has 5473 states and 18477 transitions. [2020-11-11 17:56:43,463 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.5) internal successors, (66), 12 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:43,463 INFO L276 IsEmpty]: Start isEmpty. Operand 5473 states and 18477 transitions. [2020-11-11 17:56:43,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-11-11 17:56:43,480 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:43,481 INFO L494 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] [2020-11-11 17:56:43,481 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-11 17:56:43,481 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:43,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:43,482 INFO L82 PathProgramCache]: Analyzing trace with hash 359248118, now seen corresponding path program 1 times [2020-11-11 17:56:43,482 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:43,482 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845127818] [2020-11-11 17:56:43,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:43,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:43,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:43,622 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845127818] [2020-11-11 17:56:43,622 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:43,622 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:56:43,622 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38341369] [2020-11-11 17:56:43,623 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:56:43,623 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:43,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:56:43,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:56:43,624 INFO L87 Difference]: Start difference. First operand 5473 states and 18477 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:43,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:43,819 INFO L93 Difference]: Finished difference Result 6553 states and 21657 transitions. [2020-11-11 17:56:43,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:56:43,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 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 66 [2020-11-11 17:56:43,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:43,836 INFO L225 Difference]: With dead ends: 6553 [2020-11-11 17:56:43,837 INFO L226 Difference]: Without dead ends: 4761 [2020-11-11 17:56:43,837 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:56:43,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4761 states. [2020-11-11 17:56:43,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4761 to 4761. [2020-11-11 17:56:43,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4761 states, 4760 states have (on average 3.2884453781512604) internal successors, (15653), 4760 states have internal predecessors, (15653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4761 states to 4761 states and 15653 transitions. [2020-11-11 17:56:44,003 INFO L78 Accepts]: Start accepts. Automaton has 4761 states and 15653 transitions. Word has length 66 [2020-11-11 17:56:44,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:44,004 INFO L481 AbstractCegarLoop]: Abstraction has 4761 states and 15653 transitions. [2020-11-11 17:56:44,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 6 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,004 INFO L276 IsEmpty]: Start isEmpty. Operand 4761 states and 15653 transitions. [2020-11-11 17:56:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-11-11 17:56:44,019 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:44,019 INFO L494 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] [2020-11-11 17:56:44,019 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-11 17:56:44,019 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:44,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:44,020 INFO L82 PathProgramCache]: Analyzing trace with hash -1145409332, now seen corresponding path program 1 times [2020-11-11 17:56:44,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:44,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302903121] [2020-11-11 17:56:44,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:44,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:44,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:44,174 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302903121] [2020-11-11 17:56:44,175 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:44,175 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 17:56:44,175 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048281015] [2020-11-11 17:56:44,176 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 17:56:44,176 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:44,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 17:56:44,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-11 17:56:44,177 INFO L87 Difference]: Start difference. First operand 4761 states and 15653 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:44,399 INFO L93 Difference]: Finished difference Result 4431 states and 14044 transitions. [2020-11-11 17:56:44,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-11-11 17:56:44,400 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-11-11 17:56:44,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:44,413 INFO L225 Difference]: With dead ends: 4431 [2020-11-11 17:56:44,413 INFO L226 Difference]: Without dead ends: 3039 [2020-11-11 17:56:44,413 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-11-11 17:56:44,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3039 states. [2020-11-11 17:56:44,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3039 to 3039. [2020-11-11 17:56:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3039 states, 3038 states have (on average 3.1036866359447006) internal successors, (9429), 3038 states have internal predecessors, (9429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3039 states to 3039 states and 9429 transitions. [2020-11-11 17:56:44,495 INFO L78 Accepts]: Start accepts. Automaton has 3039 states and 9429 transitions. Word has length 67 [2020-11-11 17:56:44,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:44,495 INFO L481 AbstractCegarLoop]: Abstraction has 3039 states and 9429 transitions. [2020-11-11 17:56:44,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,495 INFO L276 IsEmpty]: Start isEmpty. Operand 3039 states and 9429 transitions. [2020-11-11 17:56:44,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-11 17:56:44,502 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:44,502 INFO L494 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] [2020-11-11 17:56:44,502 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-11 17:56:44,502 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:44,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:44,503 INFO L82 PathProgramCache]: Analyzing trace with hash 1044014573, now seen corresponding path program 1 times [2020-11-11 17:56:44,503 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:44,506 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263304470] [2020-11-11 17:56:44,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:44,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:44,671 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263304470] [2020-11-11 17:56:44,671 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:44,671 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-11-11 17:56:44,672 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281402669] [2020-11-11 17:56:44,674 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-11-11 17:56:44,675 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:44,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-11-11 17:56:44,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-11-11 17:56:44,676 INFO L87 Difference]: Start difference. First operand 3039 states and 9429 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:44,812 INFO L93 Difference]: Finished difference Result 4483 states and 13915 transitions. [2020-11-11 17:56:44,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-11 17:56:44,813 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-11 17:56:44,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:44,823 INFO L225 Difference]: With dead ends: 4483 [2020-11-11 17:56:44,823 INFO L226 Difference]: Without dead ends: 2457 [2020-11-11 17:56:44,825 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:56:44,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2020-11-11 17:56:44,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2457. [2020-11-11 17:56:44,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2457 states, 2456 states have (on average 3.085912052117264) internal successors, (7579), 2456 states have internal predecessors, (7579), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2457 states to 2457 states and 7579 transitions. [2020-11-11 17:56:44,897 INFO L78 Accepts]: Start accepts. Automaton has 2457 states and 7579 transitions. Word has length 69 [2020-11-11 17:56:44,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:44,898 INFO L481 AbstractCegarLoop]: Abstraction has 2457 states and 7579 transitions. [2020-11-11 17:56:44,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:44,898 INFO L276 IsEmpty]: Start isEmpty. Operand 2457 states and 7579 transitions. [2020-11-11 17:56:44,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2020-11-11 17:56:44,905 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:44,905 INFO L494 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] [2020-11-11 17:56:44,905 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-11 17:56:44,905 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:44,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:44,906 INFO L82 PathProgramCache]: Analyzing trace with hash 327967005, now seen corresponding path program 2 times [2020-11-11 17:56:44,906 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:44,906 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656331178] [2020-11-11 17:56:44,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:45,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:45,052 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656331178] [2020-11-11 17:56:45,052 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:45,053 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-11 17:56:45,053 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978808331] [2020-11-11 17:56:45,053 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-11 17:56:45,053 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:45,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-11 17:56:45,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-11-11 17:56:45,054 INFO L87 Difference]: Start difference. First operand 2457 states and 7579 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:45,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:45,234 INFO L93 Difference]: Finished difference Result 3903 states and 11917 transitions. [2020-11-11 17:56:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-11 17:56:45,235 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2020-11-11 17:56:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:45,244 INFO L225 Difference]: With dead ends: 3903 [2020-11-11 17:56:45,244 INFO L226 Difference]: Without dead ends: 2577 [2020-11-11 17:56:45,244 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-11 17:56:45,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2577 states. [2020-11-11 17:56:45,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2577 to 2289. [2020-11-11 17:56:45,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2289 states, 2288 states have (on average 3.019667832167832) internal successors, (6909), 2288 states have internal predecessors, (6909), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2289 states to 2289 states and 6909 transitions. [2020-11-11 17:56:45,320 INFO L78 Accepts]: Start accepts. Automaton has 2289 states and 6909 transitions. Word has length 69 [2020-11-11 17:56:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:45,321 INFO L481 AbstractCegarLoop]: Abstraction has 2289 states and 6909 transitions. [2020-11-11 17:56:45,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 6 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 2289 states and 6909 transitions. [2020-11-11 17:56:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-11-11 17:56:45,327 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:45,327 INFO L494 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] [2020-11-11 17:56:45,328 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-11 17:56:45,328 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:45,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:45,328 INFO L82 PathProgramCache]: Analyzing trace with hash -624489589, now seen corresponding path program 1 times [2020-11-11 17:56:45,329 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:45,329 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836758253] [2020-11-11 17:56:45,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-11 17:56:45,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-11 17:56:45,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836758253] [2020-11-11 17:56:45,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-11 17:56:45,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-11-11 17:56:45,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861083294] [2020-11-11 17:56:45,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-11 17:56:45,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-11 17:56:45,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-11 17:56:45,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-11-11 17:56:45,505 INFO L87 Difference]: Start difference. First operand 2289 states and 6909 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:45,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-11 17:56:45,796 INFO L93 Difference]: Finished difference Result 1623 states and 4662 transitions. [2020-11-11 17:56:45,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-11-11 17:56:45,797 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2020-11-11 17:56:45,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-11 17:56:45,799 INFO L225 Difference]: With dead ends: 1623 [2020-11-11 17:56:45,799 INFO L226 Difference]: Without dead ends: 699 [2020-11-11 17:56:45,800 INFO L749 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2020-11-11 17:56:45,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 699 states. [2020-11-11 17:56:45,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 699 to 699. [2020-11-11 17:56:45,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 699 states, 698 states have (on average 2.7550143266475646) internal successors, (1923), 698 states have internal predecessors, (1923), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:45,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 699 states and 1923 transitions. [2020-11-11 17:56:45,818 INFO L78 Accepts]: Start accepts. Automaton has 699 states and 1923 transitions. Word has length 70 [2020-11-11 17:56:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-11 17:56:45,818 INFO L481 AbstractCegarLoop]: Abstraction has 699 states and 1923 transitions. [2020-11-11 17:56:45,818 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 8 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-11-11 17:56:45,819 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states and 1923 transitions. [2020-11-11 17:56:45,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2020-11-11 17:56:45,821 INFO L486 BasicCegarLoop]: Found error trace [2020-11-11 17:56:45,821 INFO L494 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] [2020-11-11 17:56:45,821 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-11 17:56:45,821 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-11 17:56:45,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-11 17:56:45,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1871375059, now seen corresponding path program 1 times [2020-11-11 17:56:45,822 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-11 17:56:45,822 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502698734] [2020-11-11 17:56:45,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-11 17:56:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 17:56:45,873 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 17:56:45,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-11 17:56:45,933 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-11 17:56:45,982 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-11 17:56:45,983 INFO L595 BasicCegarLoop]: Counterexample might be feasible [2020-11-11 17:56:45,983 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-11 17:56:46,187 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 05:56:46 BasicIcfg [2020-11-11 17:56:46,187 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-11 17:56:46,190 INFO L168 Benchmark]: Toolchain (without parser) took 21730.92 ms. Allocated memory was 302.0 MB in the beginning and 5.0 GB in the end (delta: 4.7 GB). Free memory was 275.8 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 296.1 MB. Max. memory is 16.0 GB. [2020-11-11 17:56:46,190 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 302.0 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-11-11 17:56:46,191 INFO L168 Benchmark]: CACSL2BoogieTranslator took 966.71 ms. Allocated memory is still 302.0 MB. Free memory was 275.3 MB in the beginning and 273.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.0 GB. [2020-11-11 17:56:46,192 INFO L168 Benchmark]: Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 302.0 MB. Free memory was 273.7 MB in the beginning and 270.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 17:56:46,192 INFO L168 Benchmark]: Boogie Preprocessor took 40.66 ms. Allocated memory is still 302.0 MB. Free memory was 270.7 MB in the beginning and 268.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-11-11 17:56:46,193 INFO L168 Benchmark]: RCFGBuilder took 2362.06 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 268.6 MB in the beginning and 264.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.0 GB. [2020-11-11 17:56:46,194 INFO L168 Benchmark]: TraceAbstraction took 18281.42 ms. Allocated memory was 362.8 MB in the beginning and 5.0 GB in the end (delta: 4.6 GB). Free memory was 263.9 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 220.9 MB. Max. memory is 16.0 GB. [2020-11-11 17:56:46,197 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.21 ms. Allocated memory is still 302.0 MB. Free memory is still 270.9 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 966.71 ms. Allocated memory is still 302.0 MB. Free memory was 275.3 MB in the beginning and 273.7 MB in the end (delta: 1.5 MB). Peak memory consumption was 31.7 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 64.80 ms. Allocated memory is still 302.0 MB. Free memory was 273.7 MB in the beginning and 270.7 MB in the end (delta: 3.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 40.66 ms. Allocated memory is still 302.0 MB. Free memory was 270.7 MB in the beginning and 268.6 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2362.06 ms. Allocated memory was 302.0 MB in the beginning and 362.8 MB in the end (delta: 60.8 MB). Free memory was 268.6 MB in the beginning and 264.9 MB in the end (delta: 3.7 MB). Peak memory consumption was 135.8 MB. Max. memory is 16.0 GB. * TraceAbstraction took 18281.42 ms. Allocated memory was 362.8 MB in the beginning and 5.0 GB in the end (delta: 4.6 GB). Free memory was 263.9 MB in the beginning and 4.7 GB in the end (delta: -4.4 GB). Peak memory consumption was 220.9 MB. Max. memory is 16.0 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 17]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L709] 0 int __unbuffered_cnt = 0; VAL [__unbuffered_cnt=0] [L711] 0 int __unbuffered_p2_EAX = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0] [L712] 0 _Bool main$tmp_guard0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0] [L713] 0 _Bool main$tmp_guard1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0] [L715] 0 int x = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0] [L717] 0 int y = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0] [L718] 0 _Bool y$flush_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0] [L719] 0 int y$mem_tmp; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0] [L720] 0 _Bool y$r_buff0_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0] [L721] 0 _Bool y$r_buff0_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0] [L722] 0 _Bool y$r_buff0_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0] [L723] 0 _Bool y$r_buff0_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0] [L724] 0 _Bool y$r_buff1_thd0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0] [L725] 0 _Bool y$r_buff1_thd1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0] [L726] 0 _Bool y$r_buff1_thd2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0] [L727] 0 _Bool y$r_buff1_thd3; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0] [L728] 0 _Bool y$read_delayed; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0] [L729] 0 int *y$read_delayed_var; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}] [L730] 0 int y$w_buff0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0] [L731] 0 _Bool y$w_buff0_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0] [L732] 0 int y$w_buff1; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0] [L733] 0 _Bool y$w_buff1_used; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L735] 0 int z = 0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L736] 0 _Bool weak$$choice0; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L737] 0 _Bool weak$$choice2; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 0 pthread_t t1498; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L814] FCALL, FORK 0 pthread_create(&t1498, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L815] 0 pthread_t t1499; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L816] FCALL, FORK 0 pthread_create(&t1499, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L817] 0 pthread_t t1500; VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L818] FCALL, FORK 0 pthread_create(&t1500, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L776] 3 y$w_buff1 = y$w_buff0 [L777] 3 y$w_buff0 = 2 [L778] 3 y$w_buff1_used = y$w_buff0_used [L779] 3 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 3 !(!expression) [L781] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L782] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L783] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L784] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L785] 3 y$r_buff0_thd3 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L741] 1 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L744] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L749] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L756] 2 x = 2 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L759] 2 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L762] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L762] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L763] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L763] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L764] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L764] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L765] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L765] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L766] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L766] 2 y$r_buff1_thd2 = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L769] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] EXPR 0 y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y [L824] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L824] 0 y = y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) [L825] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L825] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L826] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L826] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L827] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L827] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L828] EXPR 0 y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L828] 0 y$r_buff1_thd0 = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$r_buff1_thd0 [L831] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L832] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L833] 0 y$flush_delayed = weak$$choice2 [L834] 0 y$mem_tmp = y [L835] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L835] 0 y = !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0) [L836] EXPR 0 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L836] 0 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff0)) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1) [L837] EXPR 0 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L837] 0 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff1 : y$w_buff1)) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used) [L838] EXPR 0 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L838] 0 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used)) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L839] EXPR 0 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L839] 0 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0) [L840] EXPR 0 weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L840] 0 y$r_buff0_thd0 = weak$$choice2 ? y$r_buff0_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff0_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0)) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L841] EXPR 0 weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L841] 0 y$r_buff1_thd0 = weak$$choice2 ? y$r_buff1_thd0 : (!y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y$r_buff1_thd0 : (y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L842] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0) [L843] EXPR 0 y$flush_delayed ? y$mem_tmp : y [L843] 0 y = y$flush_delayed ? y$mem_tmp : y [L844] 0 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix056_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=50, weak$$choice2=0, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 98 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 17.9s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.1s, HoareTripleCheckerStatistics: 2134 SDtfs, 3013 SDslu, 8789 SDs, 0 SdLazy, 1211 SolverSat, 234 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14905occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.8s AutomataMinimizationTime, 16 MinimizatonAttempts, 3634 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 1104 NumberOfCodeBlocks, 1104 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1014 ConstructedInterpolants, 0 QuantifiedInterpolants, 325368 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...