/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-keepdead.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-aa1e80b [2020-12-17 23:51:25,665 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-17 23:51:25,668 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-17 23:51:25,719 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-17 23:51:25,720 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-17 23:51:25,724 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-17 23:51:25,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-17 23:51:25,736 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-17 23:51:25,739 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-17 23:51:25,745 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-17 23:51:25,747 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-17 23:51:25,748 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-17 23:51:25,749 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-17 23:51:25,752 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-17 23:51:25,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-17 23:51:25,756 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-17 23:51:25,757 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-17 23:51:25,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-17 23:51:25,769 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-17 23:51:25,779 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-17 23:51:25,781 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-17 23:51:25,783 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-17 23:51:25,785 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-17 23:51:25,787 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-17 23:51:25,796 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-17 23:51:25,796 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-17 23:51:25,797 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-17 23:51:25,799 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-17 23:51:25,800 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-17 23:51:25,801 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-17 23:51:25,801 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-17 23:51:25,802 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-17 23:51:25,804 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-17 23:51:25,805 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-17 23:51:25,806 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-17 23:51:25,806 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-17 23:51:25,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-17 23:51:25,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-17 23:51:25,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-17 23:51:25,809 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-17 23:51:25,809 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-17 23:51:25,810 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-keepdead.epf [2020-12-17 23:51:25,869 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-17 23:51:25,869 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-17 23:51:25,870 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-17 23:51:25,871 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-17 23:51:25,871 INFO L138 SettingsManager]: * Use SBE=true [2020-12-17 23:51:25,871 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-17 23:51:25,871 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-17 23:51:25,872 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-17 23:51:25,872 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-17 23:51:25,872 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-17 23:51:25,872 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-17 23:51:25,872 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-17 23:51:25,873 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-17 23:51:25,873 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-17 23:51:25,873 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-17 23:51:25,873 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-17 23:51:25,873 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-17 23:51:25,874 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-17 23:51:25,874 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-17 23:51:25,874 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-17 23:51:25,874 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-17 23:51:25,875 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-17 23:51:25,875 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-17 23:51:25,875 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-17 23:51:25,875 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-17 23:51:25,876 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-17 23:51:25,876 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-17 23:51:25,876 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2020-12-17 23:51:25,876 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-17 23:51:25,876 INFO L138 SettingsManager]: * Remove dead ends from automaton=false [2020-12-17 23:51:25,877 INFO L138 SettingsManager]: * Minimization of abstraction=NONE [2020-12-17 23:51:25,877 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-12-17 23:51:26,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-17 23:51:26,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-17 23:51:26,299 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-17 23:51:26,301 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-17 23:51:26,302 INFO L275 PluginConnector]: CDTParser initialized [2020-12-17 23:51:26,303 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-12-17 23:51:26,387 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3bcbd77/957dc8bccd4c4264ae55840e79820b3f/FLAG89fe76db9 [2020-12-17 23:51:27,193 INFO L306 CDTParser]: Found 1 translation units. [2020-12-17 23:51:27,194 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe017_pso.opt.i [2020-12-17 23:51:27,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3bcbd77/957dc8bccd4c4264ae55840e79820b3f/FLAG89fe76db9 [2020-12-17 23:51:27,368 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cf3bcbd77/957dc8bccd4c4264ae55840e79820b3f [2020-12-17 23:51:27,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-17 23:51:27,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-12-17 23:51:27,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-17 23:51:27,387 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-17 23:51:27,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-17 23:51:27,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:51:27" (1/1) ... [2020-12-17 23:51:27,396 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2834b8ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:27, skipping insertion in model container [2020-12-17 23:51:27,397 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 11:51:27" (1/1) ... [2020-12-17 23:51:27,405 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-17 23:51:27,481 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-17 23:51:28,072 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-17 23:51:28,083 INFO L203 MainTranslator]: Completed pre-run [2020-12-17 23:51:28,172 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-17 23:51:28,339 INFO L208 MainTranslator]: Completed translation [2020-12-17 23:51:28,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28 WrapperNode [2020-12-17 23:51:28,340 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-17 23:51:28,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-17 23:51:28,344 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-17 23:51:28,346 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-17 23:51:28,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,407 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,468 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-17 23:51:28,469 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-17 23:51:28,469 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-17 23:51:28,469 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-17 23:51:28,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,502 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,522 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,530 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (1/1) ... [2020-12-17 23:51:28,535 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-17 23:51:28,536 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-17 23:51:28,536 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-17 23:51:28,536 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-17 23:51:28,537 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (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-12-17 23:51:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-12-17 23:51:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-12-17 23:51:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-17 23:51:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-12-17 23:51:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-12-17 23:51:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-12-17 23:51:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-12-17 23:51:28,636 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-12-17 23:51:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-12-17 23:51:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-12-17 23:51:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-17 23:51:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-12-17 23:51:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-17 23:51:28,637 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-17 23:51:28,639 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-12-17 23:51:31,462 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-17 23:51:31,462 INFO L298 CfgBuilder]: Removed 14 assume(true) statements. [2020-12-17 23:51:31,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:51:31 BoogieIcfgContainer [2020-12-17 23:51:31,465 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-17 23:51:31,467 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-17 23:51:31,467 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-17 23:51:31,472 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-17 23:51:31,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 11:51:27" (1/3) ... [2020-12-17 23:51:31,473 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf08615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:51:31, skipping insertion in model container [2020-12-17 23:51:31,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 11:51:28" (2/3) ... [2020-12-17 23:51:31,474 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bf08615 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 11:51:31, skipping insertion in model container [2020-12-17 23:51:31,474 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 11:51:31" (3/3) ... [2020-12-17 23:51:31,476 INFO L111 eAbstractionObserver]: Analyzing ICFG safe017_pso.opt.i [2020-12-17 23:51:31,492 WARN L168 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-12-17 23:51:31,493 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-17 23:51:31,496 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-12-17 23:51:31,497 INFO L351 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-12-17 23:51:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,536 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,536 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,537 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,537 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,538 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,538 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,539 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,539 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,540 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,540 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,541 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,541 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,542 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,543 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,544 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,545 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,545 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,546 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,546 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,546 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,546 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,547 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,547 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,548 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,549 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,550 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,551 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,551 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,551 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,552 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,552 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,552 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,553 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,554 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,555 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,556 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,558 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,559 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,559 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,560 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_reach_error_#t~nondet2.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,561 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,561 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,561 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,565 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,565 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,566 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,569 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,570 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,570 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,571 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-12-17 23:51:31,575 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-12-17 23:51:31,588 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-12-17 23:51:31,614 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-17 23:51:31,614 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-17 23:51:31,614 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-17 23:51:31,614 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-17 23:51:31,614 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-17 23:51:31,615 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-17 23:51:31,615 INFO L383 AbstractCegarLoop]: Minimize is NONE [2020-12-17 23:51:31,615 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-17 23:51:31,630 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 106 places, 99 transitions, 213 flow [2020-12-17 23:51:33,186 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result has 14940 states, 14936 states have (on average 3.664234065345474) internal successors, (54729), 14939 states have internal predecessors, (54729), 0 states have call successors, (0), 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-12-17 23:51:33,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 14940 states, 14936 states have (on average 3.664234065345474) internal successors, (54729), 14939 states have internal predecessors, (54729), 0 states have call successors, (0), 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-12-17 23:51:33,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2020-12-17 23:51:33,251 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:33,252 INFO L504 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] [2020-12-17 23:51:33,253 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:33,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:33,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1090650426, now seen corresponding path program 1 times [2020-12-17 23:51:33,279 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:33,279 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [301945026] [2020-12-17 23:51:33,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:33,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:33,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-12-17 23:51:33,717 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [301945026] [2020-12-17 23:51:33,718 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:33,718 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-12-17 23:51:33,720 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548034229] [2020-12-17 23:51:33,725 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-17 23:51:33,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:33,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-17 23:51:33,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-17 23:51:33,777 INFO L87 Difference]: Start difference. First operand has 14940 states, 14936 states have (on average 3.664234065345474) internal successors, (54729), 14939 states have internal predecessors, (54729), 0 states have call successors, (0), 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 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-17 23:51:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:34,192 INFO L93 Difference]: Finished difference Result 12388 states and 43892 transitions. [2020-12-17 23:51:34,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-17 23:51:34,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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 38 [2020-12-17 23:51:34,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:34,197 INFO L763 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-12-17 23:51:34,197 INFO L78 Accepts]: Start accepts. Automaton has 12388 states and 43892 transitions. Word has length 38 [2020-12-17 23:51:34,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:34,199 INFO L481 AbstractCegarLoop]: Abstraction has 12388 states and 43892 transitions. [2020-12-17 23:51:34,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 3 states, 2 states have (on average 19.0) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 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-12-17 23:51:34,199 INFO L276 IsEmpty]: Start isEmpty. Operand 12388 states and 43892 transitions. [2020-12-17 23:51:34,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2020-12-17 23:51:34,222 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:34,223 INFO L504 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] [2020-12-17 23:51:34,223 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-17 23:51:34,223 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:34,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:34,224 INFO L82 PathProgramCache]: Analyzing trace with hash -2030452505, now seen corresponding path program 1 times [2020-12-17 23:51:34,224 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:34,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747097216] [2020-12-17 23:51:34,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:34,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:34,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:34,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747097216] [2020-12-17 23:51:34,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:34,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:51:34,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562011020] [2020-12-17 23:51:34,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:51:34,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:34,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:51:34,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:51:34,649 INFO L87 Difference]: Start difference. First operand 12388 states and 43892 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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-12-17 23:51:35,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:35,193 INFO L93 Difference]: Finished difference Result 16644 states and 58656 transitions. [2020-12-17 23:51:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-17 23:51:35,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2020-12-17 23:51:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:35,196 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:51:35,196 INFO L78 Accepts]: Start accepts. Automaton has 16644 states and 58656 transitions. Word has length 59 [2020-12-17 23:51:35,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:35,197 INFO L481 AbstractCegarLoop]: Abstraction has 16644 states and 58656 transitions. [2020-12-17 23:51:35,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 6 states have internal predecessors, (59), 0 states have call successors, (0), 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-12-17 23:51:35,198 INFO L276 IsEmpty]: Start isEmpty. Operand 16644 states and 58656 transitions. [2020-12-17 23:51:35,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2020-12-17 23:51:35,222 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:35,222 INFO L504 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] [2020-12-17 23:51:35,222 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-17 23:51:35,222 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:35,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:35,224 INFO L82 PathProgramCache]: Analyzing trace with hash 382384104, now seen corresponding path program 1 times [2020-12-17 23:51:35,225 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:35,225 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533050425] [2020-12-17 23:51:35,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:35,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:35,623 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533050425] [2020-12-17 23:51:35,624 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:35,624 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-17 23:51:35,624 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914220720] [2020-12-17 23:51:35,624 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-17 23:51:35,625 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:35,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-17 23:51:35,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-17 23:51:35,626 INFO L87 Difference]: Start difference. First operand 16644 states and 58656 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-17 23:51:36,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:36,389 INFO L93 Difference]: Finished difference Result 27600 states and 96724 transitions. [2020-12-17 23:51:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-17 23:51:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2020-12-17 23:51:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:36,392 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2020-12-17 23:51:36,392 INFO L78 Accepts]: Start accepts. Automaton has 27600 states and 96724 transitions. Word has length 61 [2020-12-17 23:51:36,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:36,393 INFO L481 AbstractCegarLoop]: Abstraction has 27600 states and 96724 transitions. [2020-12-17 23:51:36,393 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 0 states have call successors, (0), 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-12-17 23:51:36,394 INFO L276 IsEmpty]: Start isEmpty. Operand 27600 states and 96724 transitions. [2020-12-17 23:51:36,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2020-12-17 23:51:36,533 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:36,533 INFO L504 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-12-17 23:51:36,534 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-17 23:51:36,534 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:36,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:36,535 INFO L82 PathProgramCache]: Analyzing trace with hash -1191164537, now seen corresponding path program 1 times [2020-12-17 23:51:36,535 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:36,538 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617644239] [2020-12-17 23:51:36,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:37,032 WARN L193 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 13 [2020-12-17 23:51:37,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:37,143 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617644239] [2020-12-17 23:51:37,143 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:37,143 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-17 23:51:37,144 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824454874] [2020-12-17 23:51:37,145 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-17 23:51:37,145 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:37,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-17 23:51:37,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:51:37,148 INFO L87 Difference]: Start difference. First operand 27600 states and 96724 transitions. Second operand has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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-12-17 23:51:38,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:38,059 INFO L93 Difference]: Finished difference Result 40996 states and 143190 transitions. [2020-12-17 23:51:38,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-17 23:51:38,060 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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-12-17 23:51:38,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:38,061 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=227, Unknown=0, NotChecked=0, Total=342 [2020-12-17 23:51:38,061 INFO L78 Accepts]: Start accepts. Automaton has 40996 states and 143190 transitions. Word has length 63 [2020-12-17 23:51:38,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:38,062 INFO L481 AbstractCegarLoop]: Abstraction has 40996 states and 143190 transitions. [2020-12-17 23:51:38,062 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 5.7272727272727275) internal successors, (63), 11 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-12-17 23:51:38,062 INFO L276 IsEmpty]: Start isEmpty. Operand 40996 states and 143190 transitions. [2020-12-17 23:51:38,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2020-12-17 23:51:38,127 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:38,127 INFO L504 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-12-17 23:51:38,128 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-17 23:51:38,128 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:38,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:38,129 INFO L82 PathProgramCache]: Analyzing trace with hash -1960160977, now seen corresponding path program 1 times [2020-12-17 23:51:38,129 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:38,129 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119161957] [2020-12-17 23:51:38,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:38,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:38,644 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119161957] [2020-12-17 23:51:38,645 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:38,645 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:51:38,645 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399822816] [2020-12-17 23:51:38,647 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:51:38,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:38,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:51:38,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:51:38,648 INFO L87 Difference]: Start difference. First operand 40996 states and 143190 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-12-17 23:51:39,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:39,564 INFO L93 Difference]: Finished difference Result 45836 states and 159582 transitions. [2020-12-17 23:51:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-17 23:51:39,565 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-12-17 23:51:39,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:39,566 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2020-12-17 23:51:39,566 INFO L78 Accepts]: Start accepts. Automaton has 45836 states and 159582 transitions. Word has length 64 [2020-12-17 23:51:39,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:39,567 INFO L481 AbstractCegarLoop]: Abstraction has 45836 states and 159582 transitions. [2020-12-17 23:51:39,570 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-12-17 23:51:39,570 INFO L276 IsEmpty]: Start isEmpty. Operand 45836 states and 159582 transitions. [2020-12-17 23:51:39,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2020-12-17 23:51:39,673 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:39,673 INFO L504 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-12-17 23:51:39,673 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-17 23:51:39,673 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:39,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:39,674 INFO L82 PathProgramCache]: Analyzing trace with hash 642886843, now seen corresponding path program 1 times [2020-12-17 23:51:39,677 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:39,677 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041279796] [2020-12-17 23:51:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:39,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:39,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:39,863 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041279796] [2020-12-17 23:51:39,864 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:39,864 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-17 23:51:39,864 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561299681] [2020-12-17 23:51:39,865 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-17 23:51:39,865 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:39,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-17 23:51:39,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-12-17 23:51:39,866 INFO L87 Difference]: Start difference. First operand 45836 states and 159582 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-12-17 23:51:40,242 WARN L193 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2020-12-17 23:51:40,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:40,977 INFO L93 Difference]: Finished difference Result 113434 states and 387969 transitions. [2020-12-17 23:51:40,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2020-12-17 23:51:40,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-12-17 23:51:40,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:40,979 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2020-12-17 23:51:40,979 INFO L78 Accepts]: Start accepts. Automaton has 113434 states and 387969 transitions. Word has length 65 [2020-12-17 23:51:40,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:40,980 INFO L481 AbstractCegarLoop]: Abstraction has 113434 states and 387969 transitions. [2020-12-17 23:51:40,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-12-17 23:51:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 113434 states and 387969 transitions. [2020-12-17 23:51:41,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:51:41,079 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:41,080 INFO L504 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-12-17 23:51:41,080 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-17 23:51:41,080 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:41,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:41,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1867892799, now seen corresponding path program 1 times [2020-12-17 23:51:41,081 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:41,081 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86557502] [2020-12-17 23:51:41,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:41,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:41,588 WARN L193 SmtUtils]: Spent 360.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2020-12-17 23:51:41,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:41,848 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86557502] [2020-12-17 23:51:41,848 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:41,848 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:51:41,849 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422522153] [2020-12-17 23:51:41,849 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:51:41,849 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:41,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:51:41,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:51:41,851 INFO L87 Difference]: Start difference. First operand 113434 states and 387969 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-12-17 23:51:43,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:43,374 INFO L93 Difference]: Finished difference Result 130010 states and 442681 transitions. [2020-12-17 23:51:43,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-17 23:51:43,375 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-12-17 23:51:43,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:43,376 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=167, Invalid=339, Unknown=0, NotChecked=0, Total=506 [2020-12-17 23:51:43,376 INFO L78 Accepts]: Start accepts. Automaton has 130010 states and 442681 transitions. Word has length 66 [2020-12-17 23:51:43,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:43,376 INFO L481 AbstractCegarLoop]: Abstraction has 130010 states and 442681 transitions. [2020-12-17 23:51:43,377 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-12-17 23:51:43,377 INFO L276 IsEmpty]: Start isEmpty. Operand 130010 states and 442681 transitions. [2020-12-17 23:51:43,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:51:43,801 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:43,801 INFO L504 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-12-17 23:51:43,802 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-17 23:51:43,803 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:43,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:43,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1654961905, now seen corresponding path program 1 times [2020-12-17 23:51:43,809 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:43,809 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870823499] [2020-12-17 23:51:43,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:43,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:44,116 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:44,116 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870823499] [2020-12-17 23:51:44,116 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:44,117 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:51:44,117 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841654426] [2020-12-17 23:51:44,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:51:44,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:44,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:51:44,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:51:44,119 INFO L87 Difference]: Start difference. First operand 130010 states and 442681 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 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-12-17 23:51:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:45,695 INFO L93 Difference]: Finished difference Result 165783 states and 565669 transitions. [2020-12-17 23:51:45,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-12-17 23:51:45,695 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 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-12-17 23:51:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:45,696 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2020-12-17 23:51:45,697 INFO L78 Accepts]: Start accepts. Automaton has 165783 states and 565669 transitions. Word has length 66 [2020-12-17 23:51:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:45,697 INFO L481 AbstractCegarLoop]: Abstraction has 165783 states and 565669 transitions. [2020-12-17 23:51:45,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 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-12-17 23:51:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 165783 states and 565669 transitions. [2020-12-17 23:51:45,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:51:45,830 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:45,830 INFO L504 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-12-17 23:51:45,831 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-17 23:51:45,831 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:45,831 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:45,832 INFO L82 PathProgramCache]: Analyzing trace with hash 217428691, now seen corresponding path program 2 times [2020-12-17 23:51:45,832 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:45,832 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752537787] [2020-12-17 23:51:45,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:46,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:46,149 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752537787] [2020-12-17 23:51:46,149 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:46,150 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-12-17 23:51:46,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707465590] [2020-12-17 23:51:46,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-12-17 23:51:46,153 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:46,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-12-17 23:51:46,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2020-12-17 23:51:46,156 INFO L87 Difference]: Start difference. First operand 165783 states and 565669 transitions. Second operand has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 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-12-17 23:51:49,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:49,121 INFO L93 Difference]: Finished difference Result 188978 states and 644800 transitions. [2020-12-17 23:51:49,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-12-17 23:51:49,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 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-12-17 23:51:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:49,126 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=329, Unknown=0, NotChecked=0, Total=462 [2020-12-17 23:51:49,126 INFO L78 Accepts]: Start accepts. Automaton has 188978 states and 644800 transitions. Word has length 66 [2020-12-17 23:51:49,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:49,127 INFO L481 AbstractCegarLoop]: Abstraction has 188978 states and 644800 transitions. [2020-12-17 23:51:49,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 6.6) internal successors, (66), 10 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-12-17 23:51:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 188978 states and 644800 transitions. [2020-12-17 23:51:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2020-12-17 23:51:49,288 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:49,288 INFO L504 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-12-17 23:51:49,289 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-17 23:51:49,289 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1184335561, now seen corresponding path program 3 times [2020-12-17 23:51:49,290 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:49,291 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777063364] [2020-12-17 23:51:49,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:49,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:49,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:49,645 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777063364] [2020-12-17 23:51:49,646 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:49,646 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2020-12-17 23:51:49,646 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318718856] [2020-12-17 23:51:49,646 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-12-17 23:51:49,647 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:49,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-12-17 23:51:49,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2020-12-17 23:51:49,648 INFO L87 Difference]: Start difference. First operand 188978 states and 644800 transitions. Second operand has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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-12-17 23:51:52,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:52,585 INFO L93 Difference]: Finished difference Result 209706 states and 714776 transitions. [2020-12-17 23:51:52,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-12-17 23:51:52,586 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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-12-17 23:51:52,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:52,589 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=159, Invalid=393, Unknown=0, NotChecked=0, Total=552 [2020-12-17 23:51:52,590 INFO L78 Accepts]: Start accepts. Automaton has 209706 states and 714776 transitions. Word has length 66 [2020-12-17 23:51:52,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:52,590 INFO L481 AbstractCegarLoop]: Abstraction has 209706 states and 714776 transitions. [2020-12-17 23:51:52,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 11 states, 11 states have (on average 6.0) internal successors, (66), 11 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-12-17 23:51:52,590 INFO L276 IsEmpty]: Start isEmpty. Operand 209706 states and 714776 transitions. [2020-12-17 23:51:52,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-17 23:51:52,747 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:52,748 INFO L504 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-12-17 23:51:52,748 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-17 23:51:52,752 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:52,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:52,753 INFO L82 PathProgramCache]: Analyzing trace with hash -84963457, now seen corresponding path program 1 times [2020-12-17 23:51:52,753 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:52,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631346653] [2020-12-17 23:51:52,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:53,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:53,231 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631346653] [2020-12-17 23:51:53,231 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:53,231 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:51:53,231 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545831748] [2020-12-17 23:51:53,232 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:51:53,233 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:53,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:51:53,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:51:53,238 INFO L87 Difference]: Start difference. First operand 209706 states and 714776 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-12-17 23:51:55,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:55,654 INFO L93 Difference]: Finished difference Result 231462 states and 787933 transitions. [2020-12-17 23:51:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-17 23:51:55,654 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-12-17 23:51:55,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:55,656 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-12-17 23:51:55,656 INFO L78 Accepts]: Start accepts. Automaton has 231462 states and 787933 transitions. Word has length 67 [2020-12-17 23:51:55,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:55,656 INFO L481 AbstractCegarLoop]: Abstraction has 231462 states and 787933 transitions. [2020-12-17 23:51:55,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-12-17 23:51:55,657 INFO L276 IsEmpty]: Start isEmpty. Operand 231462 states and 787933 transitions. [2020-12-17 23:51:55,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-17 23:51:55,778 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:55,778 INFO L504 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-12-17 23:51:55,778 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-17 23:51:55,778 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:55,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:55,779 INFO L82 PathProgramCache]: Analyzing trace with hash 1877964614, now seen corresponding path program 1 times [2020-12-17 23:51:55,779 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:55,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937695954] [2020-12-17 23:51:55,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:56,104 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937695954] [2020-12-17 23:51:56,104 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:56,105 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2020-12-17 23:51:56,105 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215218725] [2020-12-17 23:51:56,105 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-12-17 23:51:56,105 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:51:56,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-12-17 23:51:56,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2020-12-17 23:51:56,106 INFO L87 Difference]: Start difference. First operand 231462 states and 787933 transitions. Second operand has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-12-17 23:51:59,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:51:59,545 INFO L93 Difference]: Finished difference Result 324826 states and 1094224 transitions. [2020-12-17 23:51:59,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-17 23:51:59,546 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-12-17 23:51:59,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:51:59,547 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=209, Unknown=0, NotChecked=0, Total=306 [2020-12-17 23:51:59,547 INFO L78 Accepts]: Start accepts. Automaton has 324826 states and 1094224 transitions. Word has length 67 [2020-12-17 23:51:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:51:59,547 INFO L481 AbstractCegarLoop]: Abstraction has 324826 states and 1094224 transitions. [2020-12-17 23:51:59,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 5.583333333333333) internal successors, (67), 12 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-12-17 23:51:59,547 INFO L276 IsEmpty]: Start isEmpty. Operand 324826 states and 1094224 transitions. [2020-12-17 23:51:59,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-12-17 23:51:59,778 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:51:59,778 INFO L504 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-12-17 23:51:59,779 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-17 23:51:59,779 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:51:59,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:51:59,779 INFO L82 PathProgramCache]: Analyzing trace with hash -870937938, now seen corresponding path program 1 times [2020-12-17 23:51:59,780 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:51:59,780 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15207751] [2020-12-17 23:51:59,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:51:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:51:59,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:51:59,998 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15207751] [2020-12-17 23:51:59,998 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:51:59,998 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-17 23:51:59,999 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609883583] [2020-12-17 23:51:59,999 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-17 23:51:59,999 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:52:00,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-17 23:52:00,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-12-17 23:52:00,000 INFO L87 Difference]: Start difference. First operand 324826 states and 1094224 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:52:01,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:52:01,800 INFO L93 Difference]: Finished difference Result 199220 states and 651614 transitions. [2020-12-17 23:52:01,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-12-17 23:52:01,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2020-12-17 23:52:01,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:52:01,801 INFO L763 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-12-17 23:52:01,801 INFO L78 Accepts]: Start accepts. Automaton has 199220 states and 651614 transitions. Word has length 67 [2020-12-17 23:52:01,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:52:01,802 INFO L481 AbstractCegarLoop]: Abstraction has 199220 states and 651614 transitions. [2020-12-17 23:52:01,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 6 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2020-12-17 23:52:01,802 INFO L276 IsEmpty]: Start isEmpty. Operand 199220 states and 651614 transitions. [2020-12-17 23:52:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2020-12-17 23:52:01,934 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:52:01,934 INFO L504 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] [2020-12-17 23:52:01,934 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-17 23:52:01,935 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:52:01,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:52:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash -26271715, now seen corresponding path program 1 times [2020-12-17 23:52:01,935 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:52:01,936 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683472625] [2020-12-17 23:52:01,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:52:01,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:52:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:52:02,077 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683472625] [2020-12-17 23:52:02,077 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:52:02,077 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-12-17 23:52:02,077 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282806140] [2020-12-17 23:52:02,078 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-12-17 23:52:02,078 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:52:02,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-12-17 23:52:02,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-12-17 23:52:02,079 INFO L87 Difference]: Start difference. First operand 199220 states and 651614 transitions. Second operand has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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-12-17 23:52:02,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:52:02,685 INFO L93 Difference]: Finished difference Result 76196 states and 243336 transitions. [2020-12-17 23:52:02,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-12-17 23:52:02,686 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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 68 [2020-12-17 23:52:02,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:52:02,687 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=137, Unknown=0, NotChecked=0, Total=210 [2020-12-17 23:52:02,687 INFO L78 Accepts]: Start accepts. Automaton has 76196 states and 243336 transitions. Word has length 68 [2020-12-17 23:52:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:52:02,687 INFO L481 AbstractCegarLoop]: Abstraction has 76196 states and 243336 transitions. [2020-12-17 23:52:02,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 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-12-17 23:52:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 76196 states and 243336 transitions. [2020-12-17 23:52:02,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:52:02,763 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:52:02,764 INFO L504 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-12-17 23:52:02,764 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-17 23:52:02,764 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:52:02,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:52:02,765 INFO L82 PathProgramCache]: Analyzing trace with hash -715150445, now seen corresponding path program 1 times [2020-12-17 23:52:02,765 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:52:02,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585071505] [2020-12-17 23:52:02,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:52:02,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:52:04,067 WARN L193 SmtUtils]: Spent 1.04 s on a formula simplification. DAG size of input: 40 DAG size of output: 21 [2020-12-17 23:52:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:52:04,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585071505] [2020-12-17 23:52:04,357 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:52:04,357 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-12-17 23:52:04,357 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338193076] [2020-12-17 23:52:04,358 INFO L461 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-12-17 23:52:04,358 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:52:04,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-12-17 23:52:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2020-12-17 23:52:04,359 INFO L87 Difference]: Start difference. First operand 76196 states and 243336 transitions. Second operand has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 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-12-17 23:52:05,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:52:05,353 INFO L93 Difference]: Finished difference Result 95974 states and 304350 transitions. [2020-12-17 23:52:05,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2020-12-17 23:52:05,354 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 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-12-17 23:52:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:52:05,355 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=124, Invalid=296, Unknown=0, NotChecked=0, Total=420 [2020-12-17 23:52:05,355 INFO L78 Accepts]: Start accepts. Automaton has 95974 states and 304350 transitions. Word has length 70 [2020-12-17 23:52:05,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:52:05,356 INFO L481 AbstractCegarLoop]: Abstraction has 95974 states and 304350 transitions. [2020-12-17 23:52:05,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has has 15 states, 15 states have (on average 4.666666666666667) internal successors, (70), 15 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-12-17 23:52:05,356 INFO L276 IsEmpty]: Start isEmpty. Operand 95974 states and 304350 transitions. [2020-12-17 23:52:05,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2020-12-17 23:52:05,447 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:52:05,447 INFO L504 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-12-17 23:52:05,447 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-17 23:52:05,447 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:52:05,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:52:05,448 INFO L82 PathProgramCache]: Analyzing trace with hash -1234419076, now seen corresponding path program 1 times [2020-12-17 23:52:05,448 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:52:05,448 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307447153] [2020-12-17 23:52:05,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:52:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-17 23:52:05,604 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-17 23:52:05,604 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1307447153] [2020-12-17 23:52:05,607 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-17 23:52:05,607 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2020-12-17 23:52:05,607 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520650177] [2020-12-17 23:52:05,608 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-12-17 23:52:05,608 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-17 23:52:05,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-12-17 23:52:05,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2020-12-17 23:52:05,609 INFO L87 Difference]: Start difference. First operand 95974 states and 304350 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-12-17 23:52:06,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-17 23:52:06,306 INFO L93 Difference]: Finished difference Result 52540 states and 166320 transitions. [2020-12-17 23:52:06,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-12-17 23:52:06,307 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-12-17 23:52:06,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-17 23:52:06,308 INFO L763 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=116, Invalid=226, Unknown=0, NotChecked=0, Total=342 [2020-12-17 23:52:06,308 INFO L78 Accepts]: Start accepts. Automaton has 52540 states and 166320 transitions. Word has length 70 [2020-12-17 23:52:06,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-17 23:52:06,309 INFO L481 AbstractCegarLoop]: Abstraction has 52540 states and 166320 transitions. [2020-12-17 23:52:06,310 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-12-17 23:52:06,310 INFO L276 IsEmpty]: Start isEmpty. Operand 52540 states and 166320 transitions. [2020-12-17 23:52:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2020-12-17 23:52:07,129 INFO L496 BasicCegarLoop]: Found error trace [2020-12-17 23:52:07,129 INFO L504 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] [2020-12-17 23:52:07,129 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-17 23:52:07,129 INFO L429 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-17 23:52:07,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-17 23:52:07,132 INFO L82 PathProgramCache]: Analyzing trace with hash -190033315, now seen corresponding path program 1 times [2020-12-17 23:52:07,132 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-17 23:52:07,132 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938885610] [2020-12-17 23:52:07,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-17 23:52:07,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-17 23:52:07,257 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-17 23:52:07,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-17 23:52:07,327 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-17 23:52:07,405 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-17 23:52:07,405 INFO L605 BasicCegarLoop]: Counterexample might be feasible [2020-12-17 23:52:07,406 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-17 23:52:07,609 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 11:52:07 BasicIcfg [2020-12-17 23:52:07,609 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-17 23:52:07,611 INFO L168 Benchmark]: Toolchain (without parser) took 40229.49 ms. Allocated memory was 302.0 MB in the beginning and 13.7 GB in the end (delta: 13.4 GB). Free memory was 275.9 MB in the beginning and 10.5 GB in the end (delta: -10.2 GB). Peak memory consumption was 3.2 GB. Max. memory is 16.0 GB. [2020-12-17 23:52:07,611 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 302.0 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 16.0 GB. [2020-12-17 23:52:07,612 INFO L168 Benchmark]: CACSL2BoogieTranslator took 954.82 ms. Allocated memory is still 302.0 MB. Free memory was 275.7 MB in the beginning and 270.0 MB in the end (delta: 5.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.0 GB. [2020-12-17 23:52:07,613 INFO L168 Benchmark]: Boogie Procedure Inliner took 124.53 ms. Allocated memory is still 302.0 MB. Free memory was 270.0 MB in the beginning and 267.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. [2020-12-17 23:52:07,618 INFO L168 Benchmark]: Boogie Preprocessor took 66.76 ms. Allocated memory is still 302.0 MB. Free memory was 267.9 MB in the beginning and 264.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. [2020-12-17 23:52:07,618 INFO L168 Benchmark]: RCFGBuilder took 2928.76 ms. Allocated memory is still 302.0 MB. Free memory was 264.8 MB in the beginning and 210.2 MB in the end (delta: 54.6 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. [2020-12-17 23:52:07,619 INFO L168 Benchmark]: TraceAbstraction took 36142.68 ms. Allocated memory was 302.0 MB in the beginning and 13.7 GB in the end (delta: 13.4 GB). Free memory was 210.2 MB in the beginning and 10.5 GB in the end (delta: -10.3 GB). Peak memory consumption was 3.1 GB. Max. memory is 16.0 GB. [2020-12-17 23:52:07,623 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.25 ms. Allocated memory is still 302.0 MB. Free memory is still 272.5 MB. There was no memory consumed. Max. memory is 16.0 GB. * CACSL2BoogieTranslator took 954.82 ms. Allocated memory is still 302.0 MB. Free memory was 275.7 MB in the beginning and 270.0 MB in the end (delta: 5.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 16.0 GB. * Boogie Procedure Inliner took 124.53 ms. Allocated memory is still 302.0 MB. Free memory was 270.0 MB in the beginning and 267.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.0 GB. * Boogie Preprocessor took 66.76 ms. Allocated memory is still 302.0 MB. Free memory was 267.9 MB in the beginning and 264.8 MB in the end (delta: 3.1 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.0 GB. * RCFGBuilder took 2928.76 ms. Allocated memory is still 302.0 MB. Free memory was 264.8 MB in the beginning and 210.2 MB in the end (delta: 54.6 MB). Peak memory consumption was 158.4 MB. Max. memory is 16.0 GB. * TraceAbstraction took 36142.68 ms. Allocated memory was 302.0 MB in the beginning and 13.7 GB in the end (delta: 13.4 GB). Free memory was 210.2 MB in the beginning and 10.5 GB in the end (delta: -10.3 GB). Peak memory consumption was 3.1 GB. 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] [L734] 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] [L735] 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] [L813] 0 pthread_t t2186; 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] [L814] FCALL, FORK 0 pthread_create(&t2186, ((void *)0), P0, ((void *)0)) 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] [L739] 1 y$w_buff1 = y$w_buff0 [L740] 1 y$w_buff0 = 2 [L741] 1 y$w_buff1_used = y$w_buff0_used [L742] 1 y$w_buff0_used = (_Bool)1 [L18] COND FALSE 1 !(!expression) [L744] 1 y$r_buff1_thd0 = y$r_buff0_thd0 [L745] 1 y$r_buff1_thd1 = y$r_buff0_thd1 [L746] 1 y$r_buff1_thd2 = y$r_buff0_thd2 [L747] 1 y$r_buff1_thd3 = y$r_buff0_thd3 [L748] 1 y$r_buff0_thd1 = (_Bool)1 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L815] 0 pthread_t t2187; 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L816] FCALL, FORK 0 pthread_create(&t2187, ((void *)0), P1, ((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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 pthread_t t2188; 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L818] FCALL, FORK 0 pthread_create(&t2188, ((void *)0), P2, ((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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L751] 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L768] 2 x = 2 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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L771] 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) [L771] EXPR 2 y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y [L771] 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) [L771] 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) [L772] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L772] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L773] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L773] 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 [L774] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L774] 2 y$r_buff0_thd2 = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$r_buff0_thd2 [L775] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$r_buff1_thd2 [L775] 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 [L778] 2 __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=2, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L785] 3 __unbuffered_p2_EAX = x VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L788] 3 y = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [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] EXPR 3 y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y [L791] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L791] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L792] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L792] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L793] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L793] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L794] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L794] 3 y$r_buff0_thd3 = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$r_buff0_thd3 [L795] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L795] 3 y$r_buff1_thd3 = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$r_buff1_thd3 [L798] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L754] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L754] 1 y = y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y) [L755] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L755] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L756] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L756] 1 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$w_buff1_used [L757] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L757] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L758] EXPR 1 y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L758] 1 y$r_buff1_thd1 = y$w_buff0_used && y$r_buff0_thd1 || y$w_buff1_used && y$r_buff1_thd1 ? (_Bool)0 : y$r_buff1_thd1 [L761] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L820] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L3] COND FALSE 0 !(!cond) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [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] 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] 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] 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] 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] 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] 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 == 2) [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=2, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L18] COND TRUE 0 !expression VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L17] 0 __assert_fail ("0", "safe017_pso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=2, 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=255, x=2, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=1, 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=2, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 97 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 35.7s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 23.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 1.5s, HoareTripleCheckerStatistics: 2567 SDtfs, 5400 SDslu, 11009 SDs, 0 SdLazy, 1897 SolverSat, 391 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 275 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 688 ImplicationChecksByTransitivity, 7.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=324826occurred in iteration=12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1096 NumberOfCodeBlocks, 1096 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1007 ConstructedInterpolants, 0 QuantifiedInterpolants, 392088 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...