/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe.epf -i ../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 22:03:37,586 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 22:03:37,588 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 22:03:37,604 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 22:03:37,604 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 22:03:37,607 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 22:03:37,608 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 22:03:37,621 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 22:03:37,624 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 22:03:37,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 22:03:37,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 22:03:37,630 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 22:03:37,630 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 22:03:37,633 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 22:03:37,634 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 22:03:37,636 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 22:03:37,638 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 22:03:37,640 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 22:03:37,642 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 22:03:37,647 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 22:03:37,649 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 22:03:37,654 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 22:03:37,655 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 22:03:37,656 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 22:03:37,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 22:03:37,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 22:03:37,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 22:03:37,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 22:03:37,663 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 22:03:37,664 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 22:03:37,665 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 22:03:37,666 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 22:03:37,667 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 22:03:37,668 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 22:03:37,670 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 22:03:37,670 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 22:03:37,671 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 22:03:37,671 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 22:03:37,671 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 22:03:37,674 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 22:03:37,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 22:03:37,677 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-VariableLbe.epf [2019-12-18 22:03:37,696 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 22:03:37,696 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 22:03:37,698 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 22:03:37,698 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 22:03:37,698 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 22:03:37,699 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 22:03:37,699 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 22:03:37,699 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 22:03:37,699 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 22:03:37,699 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 22:03:37,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 22:03:37,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 22:03:37,701 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 22:03:37,701 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 22:03:37,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 22:03:37,702 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 22:03:37,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 22:03:37,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 22:03:37,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 22:03:37,703 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 22:03:37,703 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 22:03:37,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 22:03:37,703 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 22:03:37,703 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 22:03:37,704 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 22:03:37,704 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 22:03:37,704 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 22:03:37,704 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 22:03:37,704 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 22:03:37,704 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 22:03:37,991 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 22:03:38,007 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 22:03:38,010 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 22:03:38,011 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 22:03:38,012 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 22:03:38,012 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2019-12-18 22:03:38,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae61457e/fbe503632486454d9b3ffa79b227ccbb/FLAGb110d360d [2019-12-18 22:03:38,708 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 22:03:38,708 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi003_tso.opt.i [2019-12-18 22:03:38,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae61457e/fbe503632486454d9b3ffa79b227ccbb/FLAGb110d360d [2019-12-18 22:03:38,929 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2ae61457e/fbe503632486454d9b3ffa79b227ccbb [2019-12-18 22:03:38,939 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 22:03:38,941 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 22:03:38,942 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:38,942 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 22:03:38,945 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 22:03:38,946 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:38" (1/1) ... [2019-12-18 22:03:38,949 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@393b8aec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:38, skipping insertion in model container [2019-12-18 22:03:38,949 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 10:03:38" (1/1) ... [2019-12-18 22:03:38,956 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 22:03:39,000 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 22:03:39,612 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:39,632 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 22:03:39,726 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 22:03:39,803 INFO L208 MainTranslator]: Completed translation [2019-12-18 22:03:39,805 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39 WrapperNode [2019-12-18 22:03:39,805 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 22:03:39,806 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:39,806 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 22:03:39,806 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 22:03:39,814 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,837 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,881 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 22:03:39,882 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 22:03:39,882 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 22:03:39,882 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 22:03:39,892 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,892 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,913 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,924 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (1/1) ... [2019-12-18 22:03:39,933 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 22:03:39,934 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 22:03:39,934 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 22:03:39,934 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 22:03:39,935 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (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 [2019-12-18 22:03:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 22:03:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 22:03:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 22:03:40,004 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 22:03:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 22:03:40,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 22:03:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 22:03:40,005 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 22:03:40,005 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 22:03:40,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 22:03:40,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 22:03:40,008 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 22:03:41,062 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 22:03:41,063 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 22:03:41,064 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:41 BoogieIcfgContainer [2019-12-18 22:03:41,065 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 22:03:41,066 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 22:03:41,066 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 22:03:41,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 22:03:41,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 10:03:38" (1/3) ... [2019-12-18 22:03:41,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad29a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:41, skipping insertion in model container [2019-12-18 22:03:41,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 10:03:39" (2/3) ... [2019-12-18 22:03:41,071 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ad29a74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 10:03:41, skipping insertion in model container [2019-12-18 22:03:41,071 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 10:03:41" (3/3) ... [2019-12-18 22:03:41,073 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi003_tso.opt.i [2019-12-18 22:03:41,083 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 22:03:41,084 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 22:03:41,092 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 22:03:41,093 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 22:03:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,136 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,136 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,137 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,137 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,138 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,139 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,140 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,141 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,142 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,143 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,144 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,145 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,146 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,147 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,149 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,149 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,150 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,150 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,151 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,152 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,153 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,154 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,155 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,156 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,157 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,158 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,159 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,160 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,161 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,162 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,163 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,164 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,165 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,166 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,167 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,168 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,169 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,170 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,171 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,172 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,173 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,174 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,175 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,176 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,177 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,178 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,179 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,180 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,181 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,182 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,183 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,184 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,185 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,186 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,187 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,188 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,189 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,190 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,193 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,194 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,194 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,195 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,196 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,196 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,199 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,200 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite66| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite62| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,201 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite64| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite60| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,202 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite57| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite55| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,203 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite59| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,204 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,205 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite65| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,206 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,206 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite61| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite63| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,207 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,208 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite56| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,208 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite58| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,209 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,209 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,210 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 22:03:41,225 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-18 22:03:41,245 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 22:03:41,245 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 22:03:41,246 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 22:03:41,246 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 22:03:41,246 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 22:03:41,246 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 22:03:41,246 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 22:03:41,246 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 22:03:41,265 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 244 places, 326 transitions [2019-12-18 22:03:41,267 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 22:03:41,405 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 22:03:41,406 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:41,466 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 22:03:41,564 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 244 places, 326 transitions [2019-12-18 22:03:41,673 INFO L126 PetriNetUnfolder]: 89/324 cut-off events. [2019-12-18 22:03:41,674 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 22:03:41,692 INFO L76 FinitePrefix]: Finished finitePrefix Result has 331 conditions, 324 events. 89/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 796 event pairs. 6/239 useless extension candidates. Maximal degree in co-relation 294. Up to 2 conditions per place. [2019-12-18 22:03:41,736 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 49222 [2019-12-18 22:03:41,738 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 22:03:45,539 WARN L192 SmtUtils]: Spent 236.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 83 [2019-12-18 22:03:45,747 INFO L206 etLargeBlockEncoding]: Checked pairs total: 300794 [2019-12-18 22:03:45,748 INFO L214 etLargeBlockEncoding]: Total number of compositions: 136 [2019-12-18 22:03:45,751 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 159 places, 198 transitions [2019-12-18 22:03:55,975 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 92954 states. [2019-12-18 22:03:55,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92954 states. [2019-12-18 22:03:55,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 22:03:55,984 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:03:55,985 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 22:03:55,985 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:03:55,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:03:55,991 INFO L82 PathProgramCache]: Analyzing trace with hash 1344850552, now seen corresponding path program 1 times [2019-12-18 22:03:55,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:03:55,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695412660] [2019-12-18 22:03:55,998 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:03:56,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:03:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:03:56,254 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695412660] [2019-12-18 22:03:56,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:03:56,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 22:03:56,256 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756554890] [2019-12-18 22:03:56,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:03:56,261 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:03:56,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:03:56,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:03:56,278 INFO L87 Difference]: Start difference. First operand 92954 states. Second operand 3 states. [2019-12-18 22:03:57,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:03:57,551 INFO L93 Difference]: Finished difference Result 92864 states and 336420 transitions. [2019-12-18 22:03:57,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:03:57,552 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 22:03:57,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:03:58,292 INFO L225 Difference]: With dead ends: 92864 [2019-12-18 22:03:58,292 INFO L226 Difference]: Without dead ends: 91016 [2019-12-18 22:03:58,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:03,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91016 states. [2019-12-18 22:04:05,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91016 to 91016. [2019-12-18 22:04:05,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91016 states. [2019-12-18 22:04:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91016 states to 91016 states and 330175 transitions. [2019-12-18 22:04:08,888 INFO L78 Accepts]: Start accepts. Automaton has 91016 states and 330175 transitions. Word has length 5 [2019-12-18 22:04:08,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:08,888 INFO L462 AbstractCegarLoop]: Abstraction has 91016 states and 330175 transitions. [2019-12-18 22:04:08,888 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 91016 states and 330175 transitions. [2019-12-18 22:04:08,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:04:08,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:08,891 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:08,891 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:08,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:08,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1965407364, now seen corresponding path program 1 times [2019-12-18 22:04:08,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:08,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023888953] [2019-12-18 22:04:08,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:08,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:08,986 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023888953] [2019-12-18 22:04:08,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:08,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:08,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2772718] [2019-12-18 22:04:08,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:08,988 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:08,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:08,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:08,989 INFO L87 Difference]: Start difference. First operand 91016 states and 330175 transitions. Second operand 4 states. [2019-12-18 22:04:10,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:10,137 INFO L93 Difference]: Finished difference Result 136127 states and 476904 transitions. [2019-12-18 22:04:10,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 22:04:10,138 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 22:04:10,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:10,574 INFO L225 Difference]: With dead ends: 136127 [2019-12-18 22:04:10,574 INFO L226 Difference]: Without dead ends: 136127 [2019-12-18 22:04:10,575 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:17,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136127 states. [2019-12-18 22:04:19,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136127 to 135155. [2019-12-18 22:04:19,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135155 states. [2019-12-18 22:04:20,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135155 states to 135155 states and 474192 transitions. [2019-12-18 22:04:20,399 INFO L78 Accepts]: Start accepts. Automaton has 135155 states and 474192 transitions. Word has length 11 [2019-12-18 22:04:20,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:20,399 INFO L462 AbstractCegarLoop]: Abstraction has 135155 states and 474192 transitions. [2019-12-18 22:04:20,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:20,399 INFO L276 IsEmpty]: Start isEmpty. Operand 135155 states and 474192 transitions. [2019-12-18 22:04:20,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 22:04:20,403 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:20,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:20,404 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:20,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:20,404 INFO L82 PathProgramCache]: Analyzing trace with hash 1027571428, now seen corresponding path program 1 times [2019-12-18 22:04:20,404 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:20,405 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963010900] [2019-12-18 22:04:20,405 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:20,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:20,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:20,457 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963010900] [2019-12-18 22:04:20,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:20,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:20,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40879844] [2019-12-18 22:04:20,458 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:20,458 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:20,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:20,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:20,458 INFO L87 Difference]: Start difference. First operand 135155 states and 474192 transitions. Second operand 3 states. [2019-12-18 22:04:20,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:20,491 INFO L93 Difference]: Finished difference Result 8128 states and 19851 transitions. [2019-12-18 22:04:20,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:20,492 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2019-12-18 22:04:20,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:20,512 INFO L225 Difference]: With dead ends: 8128 [2019-12-18 22:04:20,513 INFO L226 Difference]: Without dead ends: 8128 [2019-12-18 22:04:20,513 INFO L631 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 [2019-12-18 22:04:20,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8128 states. [2019-12-18 22:04:20,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8128 to 8088. [2019-12-18 22:04:20,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8088 states. [2019-12-18 22:04:20,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8088 states to 8088 states and 19771 transitions. [2019-12-18 22:04:20,649 INFO L78 Accepts]: Start accepts. Automaton has 8088 states and 19771 transitions. Word has length 11 [2019-12-18 22:04:20,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:20,649 INFO L462 AbstractCegarLoop]: Abstraction has 8088 states and 19771 transitions. [2019-12-18 22:04:20,649 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:20,650 INFO L276 IsEmpty]: Start isEmpty. Operand 8088 states and 19771 transitions. [2019-12-18 22:04:20,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-18 22:04:20,652 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:20,653 INFO L411 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] [2019-12-18 22:04:20,653 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:20,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:20,653 INFO L82 PathProgramCache]: Analyzing trace with hash 650384325, now seen corresponding path program 1 times [2019-12-18 22:04:20,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:20,654 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792678680] [2019-12-18 22:04:20,654 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:20,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:20,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792678680] [2019-12-18 22:04:20,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:20,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:04:20,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252662120] [2019-12-18 22:04:21,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:04:21,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:21,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:04:21,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:04:21,001 INFO L87 Difference]: Start difference. First operand 8088 states and 19771 transitions. Second operand 8 states. [2019-12-18 22:04:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:22,976 INFO L93 Difference]: Finished difference Result 10008 states and 23842 transitions. [2019-12-18 22:04:22,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:04:22,976 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-18 22:04:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:22,996 INFO L225 Difference]: With dead ends: 10008 [2019-12-18 22:04:22,996 INFO L226 Difference]: Without dead ends: 10008 [2019-12-18 22:04:22,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 5 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:04:23,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10008 states. [2019-12-18 22:04:23,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10008 to 9310. [2019-12-18 22:04:23,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9310 states. [2019-12-18 22:04:23,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9310 states to 9310 states and 22404 transitions. [2019-12-18 22:04:23,186 INFO L78 Accepts]: Start accepts. Automaton has 9310 states and 22404 transitions. Word has length 22 [2019-12-18 22:04:23,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:23,186 INFO L462 AbstractCegarLoop]: Abstraction has 9310 states and 22404 transitions. [2019-12-18 22:04:23,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:04:23,186 INFO L276 IsEmpty]: Start isEmpty. Operand 9310 states and 22404 transitions. [2019-12-18 22:04:23,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-18 22:04:23,191 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:23,192 INFO L411 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] [2019-12-18 22:04:23,192 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:23,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:23,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1389704286, now seen corresponding path program 1 times [2019-12-18 22:04:23,193 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:23,193 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177237802] [2019-12-18 22:04:23,193 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:23,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:23,303 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177237802] [2019-12-18 22:04:23,303 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:23,303 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:23,304 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291432312] [2019-12-18 22:04:23,304 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 22:04:23,304 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:23,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 22:04:23,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:23,305 INFO L87 Difference]: Start difference. First operand 9310 states and 22404 transitions. Second operand 4 states. [2019-12-18 22:04:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:23,332 INFO L93 Difference]: Finished difference Result 3456 states and 7722 transitions. [2019-12-18 22:04:23,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:04:23,333 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2019-12-18 22:04:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:23,338 INFO L225 Difference]: With dead ends: 3456 [2019-12-18 22:04:23,338 INFO L226 Difference]: Without dead ends: 3456 [2019-12-18 22:04:23,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 22:04:23,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3456 states. [2019-12-18 22:04:23,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3456 to 3380. [2019-12-18 22:04:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3380 states. [2019-12-18 22:04:23,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3380 states to 3380 states and 7581 transitions. [2019-12-18 22:04:23,397 INFO L78 Accepts]: Start accepts. Automaton has 3380 states and 7581 transitions. Word has length 34 [2019-12-18 22:04:23,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:23,397 INFO L462 AbstractCegarLoop]: Abstraction has 3380 states and 7581 transitions. [2019-12-18 22:04:23,397 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 22:04:23,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3380 states and 7581 transitions. [2019-12-18 22:04:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-18 22:04:23,409 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:23,410 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:23,410 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:23,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:23,410 INFO L82 PathProgramCache]: Analyzing trace with hash 389888815, now seen corresponding path program 1 times [2019-12-18 22:04:23,411 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:23,411 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1811914752] [2019-12-18 22:04:23,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:23,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:23,542 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1811914752] [2019-12-18 22:04:23,542 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:23,542 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:04:23,543 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846608123] [2019-12-18 22:04:23,543 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:23,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:23,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:23,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:23,544 INFO L87 Difference]: Start difference. First operand 3380 states and 7581 transitions. Second operand 5 states. [2019-12-18 22:04:24,266 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-12-18 22:04:25,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:25,085 INFO L93 Difference]: Finished difference Result 4745 states and 10599 transitions. [2019-12-18 22:04:25,085 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:04:25,086 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-18 22:04:25,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:25,091 INFO L225 Difference]: With dead ends: 4745 [2019-12-18 22:04:25,092 INFO L226 Difference]: Without dead ends: 4745 [2019-12-18 22:04:25,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:25,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4745 states. [2019-12-18 22:04:25,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4745 to 4380. [2019-12-18 22:04:25,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4380 states. [2019-12-18 22:04:25,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4380 states to 4380 states and 9781 transitions. [2019-12-18 22:04:25,163 INFO L78 Accepts]: Start accepts. Automaton has 4380 states and 9781 transitions. Word has length 93 [2019-12-18 22:04:25,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:25,166 INFO L462 AbstractCegarLoop]: Abstraction has 4380 states and 9781 transitions. [2019-12-18 22:04:25,166 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 4380 states and 9781 transitions. [2019-12-18 22:04:25,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-18 22:04:25,178 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:25,178 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:25,178 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:25,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:25,179 INFO L82 PathProgramCache]: Analyzing trace with hash -1945699553, now seen corresponding path program 2 times [2019-12-18 22:04:25,179 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:25,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187450752] [2019-12-18 22:04:25,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:25,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:25,316 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187450752] [2019-12-18 22:04:25,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:25,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:04:25,317 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633657059] [2019-12-18 22:04:25,317 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:04:25,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:25,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:04:25,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:04:25,318 INFO L87 Difference]: Start difference. First operand 4380 states and 9781 transitions. Second operand 6 states. [2019-12-18 22:04:26,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:26,359 INFO L93 Difference]: Finished difference Result 5220 states and 11638 transitions. [2019-12-18 22:04:26,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 22:04:26,360 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-18 22:04:26,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:26,365 INFO L225 Difference]: With dead ends: 5220 [2019-12-18 22:04:26,365 INFO L226 Difference]: Without dead ends: 5220 [2019-12-18 22:04:26,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:04:26,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5220 states. [2019-12-18 22:04:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5220 to 4409. [2019-12-18 22:04:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4409 states. [2019-12-18 22:04:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 9838 transitions. [2019-12-18 22:04:26,433 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 9838 transitions. Word has length 93 [2019-12-18 22:04:26,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:26,433 INFO L462 AbstractCegarLoop]: Abstraction has 4409 states and 9838 transitions. [2019-12-18 22:04:26,433 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:04:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 9838 transitions. [2019-12-18 22:04:26,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-18 22:04:26,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:26,444 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:26,445 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:26,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:26,445 INFO L82 PathProgramCache]: Analyzing trace with hash -2069303761, now seen corresponding path program 3 times [2019-12-18 22:04:26,445 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:26,445 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690730438] [2019-12-18 22:04:26,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:26,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:26,587 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:26,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690730438] [2019-12-18 22:04:26,588 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:26,588 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:04:26,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795539163] [2019-12-18 22:04:26,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 22:04:26,589 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:26,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 22:04:26,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:26,591 INFO L87 Difference]: Start difference. First operand 4409 states and 9838 transitions. Second operand 7 states. [2019-12-18 22:04:27,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:27,763 INFO L93 Difference]: Finished difference Result 5255 states and 11676 transitions. [2019-12-18 22:04:27,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 22:04:27,764 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 93 [2019-12-18 22:04:27,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:27,771 INFO L225 Difference]: With dead ends: 5255 [2019-12-18 22:04:27,772 INFO L226 Difference]: Without dead ends: 5255 [2019-12-18 22:04:27,772 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:04:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2019-12-18 22:04:27,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 4585. [2019-12-18 22:04:27,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4585 states. [2019-12-18 22:04:27,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4585 states to 4585 states and 10210 transitions. [2019-12-18 22:04:27,842 INFO L78 Accepts]: Start accepts. Automaton has 4585 states and 10210 transitions. Word has length 93 [2019-12-18 22:04:27,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:27,842 INFO L462 AbstractCegarLoop]: Abstraction has 4585 states and 10210 transitions. [2019-12-18 22:04:27,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 22:04:27,843 INFO L276 IsEmpty]: Start isEmpty. Operand 4585 states and 10210 transitions. [2019-12-18 22:04:27,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-18 22:04:27,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:27,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:27,853 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:27,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:27,853 INFO L82 PathProgramCache]: Analyzing trace with hash 779772427, now seen corresponding path program 4 times [2019-12-18 22:04:27,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:27,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609964047] [2019-12-18 22:04:27,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:27,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:27,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1609964047] [2019-12-18 22:04:27,969 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:27,969 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:04:27,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824237228] [2019-12-18 22:04:27,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:27,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:27,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:27,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:27,971 INFO L87 Difference]: Start difference. First operand 4585 states and 10210 transitions. Second operand 5 states. [2019-12-18 22:04:28,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:28,811 INFO L93 Difference]: Finished difference Result 5464 states and 12076 transitions. [2019-12-18 22:04:28,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:04:28,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 93 [2019-12-18 22:04:28,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:28,819 INFO L225 Difference]: With dead ends: 5464 [2019-12-18 22:04:28,819 INFO L226 Difference]: Without dead ends: 5464 [2019-12-18 22:04:28,819 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:04:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5464 states. [2019-12-18 22:04:28,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5464 to 4705. [2019-12-18 22:04:28,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4705 states. [2019-12-18 22:04:28,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4705 states to 4705 states and 10502 transitions. [2019-12-18 22:04:28,882 INFO L78 Accepts]: Start accepts. Automaton has 4705 states and 10502 transitions. Word has length 93 [2019-12-18 22:04:28,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:28,882 INFO L462 AbstractCegarLoop]: Abstraction has 4705 states and 10502 transitions. [2019-12-18 22:04:28,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:28,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4705 states and 10502 transitions. [2019-12-18 22:04:28,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-12-18 22:04:28,890 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:28,890 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:28,891 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:28,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:28,891 INFO L82 PathProgramCache]: Analyzing trace with hash -326394763, now seen corresponding path program 5 times [2019-12-18 22:04:28,891 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:28,891 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326210373] [2019-12-18 22:04:28,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:28,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:29,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:29,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326210373] [2019-12-18 22:04:29,024 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:29,024 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 22:04:29,024 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697657433] [2019-12-18 22:04:29,025 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:04:29,025 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:29,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:04:29,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:04:29,025 INFO L87 Difference]: Start difference. First operand 4705 states and 10502 transitions. Second operand 6 states. [2019-12-18 22:04:29,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:29,805 INFO L93 Difference]: Finished difference Result 3983 states and 8753 transitions. [2019-12-18 22:04:29,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 22:04:29,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-12-18 22:04:29,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:29,811 INFO L225 Difference]: With dead ends: 3983 [2019-12-18 22:04:29,811 INFO L226 Difference]: Without dead ends: 3983 [2019-12-18 22:04:29,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-18 22:04:29,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2019-12-18 22:04:29,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3948. [2019-12-18 22:04:29,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3948 states. [2019-12-18 22:04:29,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3948 states to 3948 states and 8683 transitions. [2019-12-18 22:04:29,867 INFO L78 Accepts]: Start accepts. Automaton has 3948 states and 8683 transitions. Word has length 93 [2019-12-18 22:04:29,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:29,867 INFO L462 AbstractCegarLoop]: Abstraction has 3948 states and 8683 transitions. [2019-12-18 22:04:29,867 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:04:29,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3948 states and 8683 transitions. [2019-12-18 22:04:29,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:04:29,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:29,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:29,875 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:29,875 INFO L82 PathProgramCache]: Analyzing trace with hash -1476050659, now seen corresponding path program 1 times [2019-12-18 22:04:29,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:29,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752594008] [2019-12-18 22:04:29,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:29,981 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:29,982 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752594008] [2019-12-18 22:04:29,982 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:29,982 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:04:29,982 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821657251] [2019-12-18 22:04:29,982 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 22:04:29,983 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:29,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 22:04:29,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 22:04:29,983 INFO L87 Difference]: Start difference. First operand 3948 states and 8683 transitions. Second operand 5 states. [2019-12-18 22:04:30,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:30,347 INFO L93 Difference]: Finished difference Result 4216 states and 9179 transitions. [2019-12-18 22:04:30,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 22:04:30,347 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2019-12-18 22:04:30,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:30,353 INFO L225 Difference]: With dead ends: 4216 [2019-12-18 22:04:30,353 INFO L226 Difference]: Without dead ends: 4216 [2019-12-18 22:04:30,354 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:04:30,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4216 states. [2019-12-18 22:04:30,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4216 to 4036. [2019-12-18 22:04:30,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4036 states. [2019-12-18 22:04:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 8856 transitions. [2019-12-18 22:04:30,394 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 8856 transitions. Word has length 95 [2019-12-18 22:04:30,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:30,394 INFO L462 AbstractCegarLoop]: Abstraction has 4036 states and 8856 transitions. [2019-12-18 22:04:30,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 22:04:30,394 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 8856 transitions. [2019-12-18 22:04:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-12-18 22:04:30,399 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:30,400 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:30,400 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:30,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:30,400 INFO L82 PathProgramCache]: Analyzing trace with hash -1866657661, now seen corresponding path program 2 times [2019-12-18 22:04:30,400 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:30,400 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169899264] [2019-12-18 22:04:30,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:30,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:30,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:30,489 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169899264] [2019-12-18 22:04:30,489 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:30,489 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 22:04:30,489 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930668871] [2019-12-18 22:04:30,490 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:30,490 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:30,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:30,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:30,490 INFO L87 Difference]: Start difference. First operand 4036 states and 8856 transitions. Second operand 3 states. [2019-12-18 22:04:30,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:30,534 INFO L93 Difference]: Finished difference Result 4035 states and 8854 transitions. [2019-12-18 22:04:30,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:30,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-12-18 22:04:30,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:30,540 INFO L225 Difference]: With dead ends: 4035 [2019-12-18 22:04:30,540 INFO L226 Difference]: Without dead ends: 4035 [2019-12-18 22:04:30,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:30,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4035 states. [2019-12-18 22:04:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4035 to 3784. [2019-12-18 22:04:30,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3784 states. [2019-12-18 22:04:30,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3784 states to 3784 states and 8380 transitions. [2019-12-18 22:04:30,605 INFO L78 Accepts]: Start accepts. Automaton has 3784 states and 8380 transitions. Word has length 95 [2019-12-18 22:04:30,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:30,606 INFO L462 AbstractCegarLoop]: Abstraction has 3784 states and 8380 transitions. [2019-12-18 22:04:30,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:30,606 INFO L276 IsEmpty]: Start isEmpty. Operand 3784 states and 8380 transitions. [2019-12-18 22:04:30,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:04:30,614 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:30,615 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:30,615 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:30,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:30,615 INFO L82 PathProgramCache]: Analyzing trace with hash -545872847, now seen corresponding path program 1 times [2019-12-18 22:04:30,615 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:30,616 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115037856] [2019-12-18 22:04:30,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:30,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:30,917 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115037856] [2019-12-18 22:04:30,917 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:30,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:04:30,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068505243] [2019-12-18 22:04:30,918 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:04:30,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:30,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:04:30,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:04:30,919 INFO L87 Difference]: Start difference. First operand 3784 states and 8380 transitions. Second operand 10 states. [2019-12-18 22:04:32,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:32,108 INFO L93 Difference]: Finished difference Result 6326 states and 13880 transitions. [2019-12-18 22:04:32,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:04:32,109 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:04:32,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:32,117 INFO L225 Difference]: With dead ends: 6326 [2019-12-18 22:04:32,117 INFO L226 Difference]: Without dead ends: 6326 [2019-12-18 22:04:32,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:04:32,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6326 states. [2019-12-18 22:04:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6326 to 5189. [2019-12-18 22:04:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5189 states. [2019-12-18 22:04:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5189 states to 5189 states and 11386 transitions. [2019-12-18 22:04:32,178 INFO L78 Accepts]: Start accepts. Automaton has 5189 states and 11386 transitions. Word has length 96 [2019-12-18 22:04:32,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:32,178 INFO L462 AbstractCegarLoop]: Abstraction has 5189 states and 11386 transitions. [2019-12-18 22:04:32,178 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:04:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 5189 states and 11386 transitions. [2019-12-18 22:04:32,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:04:32,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:32,185 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:32,185 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:32,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:32,185 INFO L82 PathProgramCache]: Analyzing trace with hash 846982815, now seen corresponding path program 2 times [2019-12-18 22:04:32,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:32,186 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949652886] [2019-12-18 22:04:32,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:32,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:32,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:32,400 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949652886] [2019-12-18 22:04:32,400 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:32,401 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:04:32,401 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155425713] [2019-12-18 22:04:32,401 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:04:32,401 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:32,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:04:32,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:04:32,402 INFO L87 Difference]: Start difference. First operand 5189 states and 11386 transitions. Second operand 10 states. [2019-12-18 22:04:33,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:33,763 INFO L93 Difference]: Finished difference Result 8940 states and 19662 transitions. [2019-12-18 22:04:33,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:04:33,764 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:04:33,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:33,774 INFO L225 Difference]: With dead ends: 8940 [2019-12-18 22:04:33,774 INFO L226 Difference]: Without dead ends: 8940 [2019-12-18 22:04:33,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=267, Unknown=0, NotChecked=0, Total=380 [2019-12-18 22:04:33,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8940 states. [2019-12-18 22:04:33,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8940 to 5369. [2019-12-18 22:04:33,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5369 states. [2019-12-18 22:04:33,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5369 states to 5369 states and 11782 transitions. [2019-12-18 22:04:33,847 INFO L78 Accepts]: Start accepts. Automaton has 5369 states and 11782 transitions. Word has length 96 [2019-12-18 22:04:33,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:33,848 INFO L462 AbstractCegarLoop]: Abstraction has 5369 states and 11782 transitions. [2019-12-18 22:04:33,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:04:33,848 INFO L276 IsEmpty]: Start isEmpty. Operand 5369 states and 11782 transitions. [2019-12-18 22:04:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:04:33,854 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:33,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:33,855 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:33,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:33,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1661033697, now seen corresponding path program 3 times [2019-12-18 22:04:33,855 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:33,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029868927] [2019-12-18 22:04:33,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:34,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:34,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:34,531 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029868927] [2019-12-18 22:04:34,531 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:34,532 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-18 22:04:34,532 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459787600] [2019-12-18 22:04:34,532 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-18 22:04:34,532 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:34,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-18 22:04:34,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-18 22:04:34,533 INFO L87 Difference]: Start difference. First operand 5369 states and 11782 transitions. Second operand 8 states. [2019-12-18 22:04:35,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:35,430 INFO L93 Difference]: Finished difference Result 6374 states and 13922 transitions. [2019-12-18 22:04:35,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 22:04:35,430 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 96 [2019-12-18 22:04:35,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:35,437 INFO L225 Difference]: With dead ends: 6374 [2019-12-18 22:04:35,437 INFO L226 Difference]: Without dead ends: 6374 [2019-12-18 22:04:35,438 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:04:35,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6374 states. [2019-12-18 22:04:35,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6374 to 5463. [2019-12-18 22:04:35,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5463 states. [2019-12-18 22:04:35,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5463 states to 5463 states and 11977 transitions. [2019-12-18 22:04:35,500 INFO L78 Accepts]: Start accepts. Automaton has 5463 states and 11977 transitions. Word has length 96 [2019-12-18 22:04:35,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:35,501 INFO L462 AbstractCegarLoop]: Abstraction has 5463 states and 11977 transitions. [2019-12-18 22:04:35,501 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-18 22:04:35,501 INFO L276 IsEmpty]: Start isEmpty. Operand 5463 states and 11977 transitions. [2019-12-18 22:04:35,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:04:35,510 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:35,510 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:35,510 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:35,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:35,510 INFO L82 PathProgramCache]: Analyzing trace with hash 1176218101, now seen corresponding path program 4 times [2019-12-18 22:04:35,511 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:35,511 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007417830] [2019-12-18 22:04:35,511 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:35,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:35,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:35,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007417830] [2019-12-18 22:04:35,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:35,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:04:35,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246721294] [2019-12-18 22:04:35,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:04:35,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:35,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:04:35,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:04:35,739 INFO L87 Difference]: Start difference. First operand 5463 states and 11977 transitions. Second operand 10 states. [2019-12-18 22:04:37,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:37,432 INFO L93 Difference]: Finished difference Result 6007 states and 13056 transitions. [2019-12-18 22:04:37,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 22:04:37,432 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 96 [2019-12-18 22:04:37,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:37,440 INFO L225 Difference]: With dead ends: 6007 [2019-12-18 22:04:37,440 INFO L226 Difference]: Without dead ends: 6007 [2019-12-18 22:04:37,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=316, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:04:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6007 states. [2019-12-18 22:04:37,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6007 to 4931. [2019-12-18 22:04:37,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4931 states. [2019-12-18 22:04:37,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4931 states to 4931 states and 10793 transitions. [2019-12-18 22:04:37,493 INFO L78 Accepts]: Start accepts. Automaton has 4931 states and 10793 transitions. Word has length 96 [2019-12-18 22:04:37,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:37,493 INFO L462 AbstractCegarLoop]: Abstraction has 4931 states and 10793 transitions. [2019-12-18 22:04:37,493 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:04:37,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4931 states and 10793 transitions. [2019-12-18 22:04:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:04:37,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:37,499 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:37,499 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash 10241457, now seen corresponding path program 5 times [2019-12-18 22:04:37,500 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:37,500 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995365954] [2019-12-18 22:04:37,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:37,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:37,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:37,841 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995365954] [2019-12-18 22:04:37,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:37,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:04:37,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132130721] [2019-12-18 22:04:37,843 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:04:37,843 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:37,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:04:37,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:04:37,844 INFO L87 Difference]: Start difference. First operand 4931 states and 10793 transitions. Second operand 11 states. [2019-12-18 22:04:39,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:39,614 INFO L93 Difference]: Finished difference Result 7996 states and 17429 transitions. [2019-12-18 22:04:39,615 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:04:39,615 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 22:04:39,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:39,624 INFO L225 Difference]: With dead ends: 7996 [2019-12-18 22:04:39,624 INFO L226 Difference]: Without dead ends: 7996 [2019-12-18 22:04:39,624 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2019-12-18 22:04:39,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7996 states. [2019-12-18 22:04:40,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7996 to 4808. [2019-12-18 22:04:40,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4808 states. [2019-12-18 22:04:40,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4808 states to 4808 states and 10482 transitions. [2019-12-18 22:04:40,196 INFO L78 Accepts]: Start accepts. Automaton has 4808 states and 10482 transitions. Word has length 96 [2019-12-18 22:04:40,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:40,197 INFO L462 AbstractCegarLoop]: Abstraction has 4808 states and 10482 transitions. [2019-12-18 22:04:40,197 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:04:40,197 INFO L276 IsEmpty]: Start isEmpty. Operand 4808 states and 10482 transitions. [2019-12-18 22:04:40,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-12-18 22:04:40,203 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:40,203 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:40,204 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:40,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:40,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1403097119, now seen corresponding path program 6 times [2019-12-18 22:04:40,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:40,204 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1755966973] [2019-12-18 22:04:40,204 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:40,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:40,444 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1755966973] [2019-12-18 22:04:40,444 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:40,444 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:04:40,444 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516436281] [2019-12-18 22:04:40,445 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-18 22:04:40,445 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-18 22:04:40,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2019-12-18 22:04:40,446 INFO L87 Difference]: Start difference. First operand 4808 states and 10482 transitions. Second operand 11 states. [2019-12-18 22:04:42,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:42,221 INFO L93 Difference]: Finished difference Result 7492 states and 16398 transitions. [2019-12-18 22:04:42,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-18 22:04:42,221 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 96 [2019-12-18 22:04:42,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:42,230 INFO L225 Difference]: With dead ends: 7492 [2019-12-18 22:04:42,231 INFO L226 Difference]: Without dead ends: 7492 [2019-12-18 22:04:42,231 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:04:42,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-12-18 22:04:42,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 4625. [2019-12-18 22:04:42,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4625 states. [2019-12-18 22:04:42,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4625 states to 4625 states and 10071 transitions. [2019-12-18 22:04:42,291 INFO L78 Accepts]: Start accepts. Automaton has 4625 states and 10071 transitions. Word has length 96 [2019-12-18 22:04:42,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:42,291 INFO L462 AbstractCegarLoop]: Abstraction has 4625 states and 10071 transitions. [2019-12-18 22:04:42,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-18 22:04:42,291 INFO L276 IsEmpty]: Start isEmpty. Operand 4625 states and 10071 transitions. [2019-12-18 22:04:42,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:04:42,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:42,297 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:42,297 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:42,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:42,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1789224143, now seen corresponding path program 1 times [2019-12-18 22:04:42,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:42,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72185664] [2019-12-18 22:04:42,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:42,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:42,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:42,577 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72185664] [2019-12-18 22:04:42,577 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:42,577 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 22:04:42,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333824521] [2019-12-18 22:04:42,578 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-18 22:04:42,578 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:42,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-18 22:04:42,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-18 22:04:42,579 INFO L87 Difference]: Start difference. First operand 4625 states and 10071 transitions. Second operand 12 states. [2019-12-18 22:04:43,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:43,702 INFO L93 Difference]: Finished difference Result 9469 states and 20603 transitions. [2019-12-18 22:04:43,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 22:04:43,703 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 97 [2019-12-18 22:04:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:43,711 INFO L225 Difference]: With dead ends: 9469 [2019-12-18 22:04:43,711 INFO L226 Difference]: Without dead ends: 6378 [2019-12-18 22:04:43,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=482, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:04:43,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6378 states. [2019-12-18 22:04:43,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6378 to 5164. [2019-12-18 22:04:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5164 states. [2019-12-18 22:04:43,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5164 states to 5164 states and 11183 transitions. [2019-12-18 22:04:43,770 INFO L78 Accepts]: Start accepts. Automaton has 5164 states and 11183 transitions. Word has length 97 [2019-12-18 22:04:43,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:43,770 INFO L462 AbstractCegarLoop]: Abstraction has 5164 states and 11183 transitions. [2019-12-18 22:04:43,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-18 22:04:43,770 INFO L276 IsEmpty]: Start isEmpty. Operand 5164 states and 11183 transitions. [2019-12-18 22:04:43,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:04:43,775 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:43,775 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:43,775 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:43,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1183365114, now seen corresponding path program 1 times [2019-12-18 22:04:43,776 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:43,776 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359554168] [2019-12-18 22:04:43,776 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:43,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:43,975 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:43,975 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359554168] [2019-12-18 22:04:43,975 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:43,975 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-18 22:04:43,976 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090937195] [2019-12-18 22:04:43,976 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 22:04:43,976 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:43,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 22:04:43,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-12-18 22:04:43,977 INFO L87 Difference]: Start difference. First operand 5164 states and 11183 transitions. Second operand 10 states. [2019-12-18 22:04:46,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:46,178 INFO L93 Difference]: Finished difference Result 7869 states and 17057 transitions. [2019-12-18 22:04:46,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-18 22:04:46,179 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 97 [2019-12-18 22:04:46,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:46,187 INFO L225 Difference]: With dead ends: 7869 [2019-12-18 22:04:46,187 INFO L226 Difference]: Without dead ends: 7869 [2019-12-18 22:04:46,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 6 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=335, Unknown=0, NotChecked=0, Total=462 [2019-12-18 22:04:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7869 states. [2019-12-18 22:04:46,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7869 to 4857. [2019-12-18 22:04:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4857 states. [2019-12-18 22:04:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4857 states to 4857 states and 10543 transitions. [2019-12-18 22:04:46,242 INFO L78 Accepts]: Start accepts. Automaton has 4857 states and 10543 transitions. Word has length 97 [2019-12-18 22:04:46,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:46,242 INFO L462 AbstractCegarLoop]: Abstraction has 4857 states and 10543 transitions. [2019-12-18 22:04:46,242 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 22:04:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 4857 states and 10543 transitions. [2019-12-18 22:04:46,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-12-18 22:04:46,246 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:46,246 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:46,247 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:46,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:46,247 INFO L82 PathProgramCache]: Analyzing trace with hash -1131062681, now seen corresponding path program 2 times [2019-12-18 22:04:46,247 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:46,247 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846635256] [2019-12-18 22:04:46,247 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:46,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:46,397 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:46,397 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846635256] [2019-12-18 22:04:46,397 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:46,397 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 22:04:46,398 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340935024] [2019-12-18 22:04:46,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 22:04:46,399 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:46,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 22:04:46,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 22:04:46,399 INFO L87 Difference]: Start difference. First operand 4857 states and 10543 transitions. Second operand 6 states. [2019-12-18 22:04:46,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:46,508 INFO L93 Difference]: Finished difference Result 7137 states and 15371 transitions. [2019-12-18 22:04:46,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 22:04:46,508 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-12-18 22:04:46,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:46,511 INFO L225 Difference]: With dead ends: 7137 [2019-12-18 22:04:46,511 INFO L226 Difference]: Without dead ends: 2304 [2019-12-18 22:04:46,512 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-12-18 22:04:46,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2304 states. [2019-12-18 22:04:46,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2304 to 2246. [2019-12-18 22:04:46,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2246 states. [2019-12-18 22:04:46,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2246 states to 2246 states and 4749 transitions. [2019-12-18 22:04:46,542 INFO L78 Accepts]: Start accepts. Automaton has 2246 states and 4749 transitions. Word has length 97 [2019-12-18 22:04:46,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:46,542 INFO L462 AbstractCegarLoop]: Abstraction has 2246 states and 4749 transitions. [2019-12-18 22:04:46,542 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 22:04:46,542 INFO L276 IsEmpty]: Start isEmpty. Operand 2246 states and 4749 transitions. [2019-12-18 22:04:46,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:04:46,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:46,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:46,546 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:46,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:46,546 INFO L82 PathProgramCache]: Analyzing trace with hash -560120904, now seen corresponding path program 1 times [2019-12-18 22:04:46,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:46,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903782781] [2019-12-18 22:04:46,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:46,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:46,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:46,814 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903782781] [2019-12-18 22:04:46,814 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:46,814 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2019-12-18 22:04:46,814 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273955420] [2019-12-18 22:04:46,814 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-18 22:04:46,814 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:46,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-18 22:04:46,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2019-12-18 22:04:46,815 INFO L87 Difference]: Start difference. First operand 2246 states and 4749 transitions. Second operand 17 states. [2019-12-18 22:04:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:47,583 INFO L93 Difference]: Finished difference Result 4893 states and 10354 transitions. [2019-12-18 22:04:47,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-18 22:04:47,584 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 98 [2019-12-18 22:04:47,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:47,591 INFO L225 Difference]: With dead ends: 4893 [2019-12-18 22:04:47,591 INFO L226 Difference]: Without dead ends: 4862 [2019-12-18 22:04:47,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=685, Unknown=0, NotChecked=0, Total=812 [2019-12-18 22:04:47,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4862 states. [2019-12-18 22:04:47,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4862 to 3614. [2019-12-18 22:04:47,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3614 states. [2019-12-18 22:04:47,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 7732 transitions. [2019-12-18 22:04:47,639 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 7732 transitions. Word has length 98 [2019-12-18 22:04:47,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:47,639 INFO L462 AbstractCegarLoop]: Abstraction has 3614 states and 7732 transitions. [2019-12-18 22:04:47,639 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-18 22:04:47,639 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 7732 transitions. [2019-12-18 22:04:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:04:47,643 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:47,643 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:47,643 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:47,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:47,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1706406613, now seen corresponding path program 1 times [2019-12-18 22:04:47,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:47,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366026403] [2019-12-18 22:04:47,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:47,691 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366026403] [2019-12-18 22:04:47,691 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:47,691 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 22:04:47,691 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483651119] [2019-12-18 22:04:47,692 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 22:04:47,693 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:47,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 22:04:47,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:47,693 INFO L87 Difference]: Start difference. First operand 3614 states and 7732 transitions. Second operand 3 states. [2019-12-18 22:04:47,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:47,802 INFO L93 Difference]: Finished difference Result 3196 states and 6484 transitions. [2019-12-18 22:04:47,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 22:04:47,802 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-12-18 22:04:47,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:47,806 INFO L225 Difference]: With dead ends: 3196 [2019-12-18 22:04:47,806 INFO L226 Difference]: Without dead ends: 3196 [2019-12-18 22:04:47,807 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 22:04:47,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3196 states. [2019-12-18 22:04:47,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3196 to 2774. [2019-12-18 22:04:47,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2774 states. [2019-12-18 22:04:47,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2774 states to 2774 states and 5692 transitions. [2019-12-18 22:04:47,854 INFO L78 Accepts]: Start accepts. Automaton has 2774 states and 5692 transitions. Word has length 98 [2019-12-18 22:04:47,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:47,855 INFO L462 AbstractCegarLoop]: Abstraction has 2774 states and 5692 transitions. [2019-12-18 22:04:47,855 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 22:04:47,855 INFO L276 IsEmpty]: Start isEmpty. Operand 2774 states and 5692 transitions. [2019-12-18 22:04:47,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:04:47,861 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:47,861 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:47,861 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:47,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:47,862 INFO L82 PathProgramCache]: Analyzing trace with hash 261378931, now seen corresponding path program 1 times [2019-12-18 22:04:47,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:47,862 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620194099] [2019-12-18 22:04:47,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:47,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:48,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:48,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620194099] [2019-12-18 22:04:48,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:48,800 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2019-12-18 22:04:48,800 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182468101] [2019-12-18 22:04:48,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-12-18 22:04:48,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:48,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-12-18 22:04:48,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=449, Unknown=0, NotChecked=0, Total=506 [2019-12-18 22:04:48,802 INFO L87 Difference]: Start difference. First operand 2774 states and 5692 transitions. Second operand 23 states. [2019-12-18 22:04:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:52,076 INFO L93 Difference]: Finished difference Result 4047 states and 8349 transitions. [2019-12-18 22:04:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-18 22:04:52,076 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 98 [2019-12-18 22:04:52,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:52,082 INFO L225 Difference]: With dead ends: 4047 [2019-12-18 22:04:52,082 INFO L226 Difference]: Without dead ends: 4007 [2019-12-18 22:04:52,083 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=157, Invalid=1325, Unknown=0, NotChecked=0, Total=1482 [2019-12-18 22:04:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4007 states. [2019-12-18 22:04:52,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4007 to 3523. [2019-12-18 22:04:52,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-12-18 22:04:52,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 7378 transitions. [2019-12-18 22:04:52,119 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 7378 transitions. Word has length 98 [2019-12-18 22:04:52,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:52,119 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 7378 transitions. [2019-12-18 22:04:52,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-12-18 22:04:52,119 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 7378 transitions. [2019-12-18 22:04:52,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:04:52,122 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:52,122 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:52,122 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:52,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:52,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1950682267, now seen corresponding path program 2 times [2019-12-18 22:04:52,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:52,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458795903] [2019-12-18 22:04:52,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 22:04:52,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 22:04:52,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458795903] [2019-12-18 22:04:52,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 22:04:52,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 22:04:52,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27019812] [2019-12-18 22:04:52,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 22:04:52,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 22:04:52,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 22:04:52,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2019-12-18 22:04:52,406 INFO L87 Difference]: Start difference. First operand 3523 states and 7378 transitions. Second operand 14 states. [2019-12-18 22:04:53,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 22:04:53,151 INFO L93 Difference]: Finished difference Result 4731 states and 9631 transitions. [2019-12-18 22:04:53,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-18 22:04:53,152 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 98 [2019-12-18 22:04:53,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 22:04:53,158 INFO L225 Difference]: With dead ends: 4731 [2019-12-18 22:04:53,158 INFO L226 Difference]: Without dead ends: 4691 [2019-12-18 22:04:53,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=522, Unknown=0, NotChecked=0, Total=600 [2019-12-18 22:04:53,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4691 states. [2019-12-18 22:04:53,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4691 to 3990. [2019-12-18 22:04:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3990 states. [2019-12-18 22:04:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3990 states to 3990 states and 8302 transitions. [2019-12-18 22:04:53,203 INFO L78 Accepts]: Start accepts. Automaton has 3990 states and 8302 transitions. Word has length 98 [2019-12-18 22:04:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 22:04:53,204 INFO L462 AbstractCegarLoop]: Abstraction has 3990 states and 8302 transitions. [2019-12-18 22:04:53,204 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 22:04:53,204 INFO L276 IsEmpty]: Start isEmpty. Operand 3990 states and 8302 transitions. [2019-12-18 22:04:53,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-12-18 22:04:53,208 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 22:04:53,208 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 22:04:53,208 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 22:04:53,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 22:04:53,208 INFO L82 PathProgramCache]: Analyzing trace with hash 379515091, now seen corresponding path program 3 times [2019-12-18 22:04:53,208 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 22:04:53,208 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074398373] [2019-12-18 22:04:53,209 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 22:04:53,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:04:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 22:04:53,374 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 22:04:53,374 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 22:04:53,380 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1385] [1385] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_48| 0 0))) (and (= v_~x~0_11 0) (= 0 v_~weak$$choice2~0_47) (= v_~y$r_buff0_thd1~0_31 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#NULL.offset_7| 0) (= 0 v_~__unbuffered_p1_EAX~0_11) (= v_~main$tmp_guard0~0_9 0) (= 0 v_~__unbuffered_p0_EAX~0_10) (= v_~y$read_delayed~0_7 0) (= 0 v_~y$r_buff1_thd1~0_28) (= v_~y$r_buff0_thd0~0_64 0) (= 0 v_~__unbuffered_cnt~0_17) (= 0 v_~y$w_buff0~0_46) (= 0 v_~y$r_buff0_thd2~0_126) (= v_~y$w_buff1_used~0_108 0) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1647~0.base_19| 4)) (= v_~y$w_buff0_used~0_199 0) (= v_~y~0_45 0) (= 0 v_~y$r_buff1_thd0~0_37) (= 0 v_~y$r_buff1_thd2~0_60) (= 0 v_~y$flush_delayed~0_23) (= 0 v_~weak$$choice0~0_11) (= 0 v_~y$read_delayed_var~0.base_7) (= (select .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19|) 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1647~0.base_19| 1) |v_#valid_46|) (= 0 |v_#NULL.base_7|) (= v_~y$mem_tmp~0_14 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1647~0.base_19|) (= v_~main$tmp_guard1~0_15 0) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1647~0.base_19|) |v_ULTIMATE.start_main_~#t1647~0.offset_15| 0))) (= v_~__unbuffered_p1_EBX~0_10 0) (= 0 |v_ULTIMATE.start_main_~#t1647~0.offset_15|) (= 0 v_~y$w_buff1~0_45) (< 0 |v_#StackHeapBarrier_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_48|, #memory_int=|v_#memory_int_10|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_#t~nondet76=|v_ULTIMATE.start_main_#t~nondet76_7|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite89=|v_ULTIMATE.start_main_#t~ite89_13|, ULTIMATE.start_main_#t~ite87=|v_ULTIMATE.start_main_#t~ite87_13|, ULTIMATE.start_main_#t~ite73=|v_ULTIMATE.start_main_#t~ite73_9|, ULTIMATE.start_main_#t~ite96=|v_ULTIMATE.start_main_#t~ite96_11|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ULTIMATE.start_main_#t~ite71=|v_ULTIMATE.start_main_#t~ite71_9|, ULTIMATE.start_main_#t~ite94=|v_ULTIMATE.start_main_#t~ite94_12|, ~y$mem_tmp~0=v_~y$mem_tmp~0_14, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_10, ULTIMATE.start_main_#t~ite92=|v_ULTIMATE.start_main_#t~ite92_13|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_11, ULTIMATE.start_main_#t~ite90=|v_ULTIMATE.start_main_#t~ite90_11|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_13|, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_31, ~y$flush_delayed~0=v_~y$flush_delayed~0_23, #length=|v_#length_15|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_17|, ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_7|, ULTIMATE.start_main_#t~ite79=|v_ULTIMATE.start_main_#t~ite79_12|, ULTIMATE.start_main_#t~ite77=|v_ULTIMATE.start_main_#t~ite77_11|, ULTIMATE.start_main_#t~ite84=|v_ULTIMATE.start_main_#t~ite84_12|, ~weak$$choice0~0=v_~weak$$choice0~0_11, #StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_#t~ite82=|v_ULTIMATE.start_main_#t~ite82_11|, ~y$w_buff1~0=v_~y$w_buff1~0_45, ULTIMATE.start_main_#t~ite80=|v_ULTIMATE.start_main_#t~ite80_14|, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_126, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_37, ~x~0=v_~x~0_11, ULTIMATE.start_main_#t~nondet75=|v_ULTIMATE.start_main_#t~nondet75_7|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ULTIMATE.start_main_~#t1647~0.offset=|v_ULTIMATE.start_main_~#t1647~0.offset_15|, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_199, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_15, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_11|, ULTIMATE.start_main_#t~ite88=|v_ULTIMATE.start_main_#t~ite88_12|, ULTIMATE.start_main_#t~ite86=|v_ULTIMATE.start_main_#t~ite86_13|, ULTIMATE.start_main_#t~ite74=|v_ULTIMATE.start_main_#t~ite74_9|, ULTIMATE.start_main_#t~ite95=|v_ULTIMATE.start_main_#t~ite95_13|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_28, ULTIMATE.start_main_#t~ite72=|v_ULTIMATE.start_main_#t~ite72_9|, ULTIMATE.start_main_#t~ite93=|v_ULTIMATE.start_main_#t~ite93_11|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_11|, ULTIMATE.start_main_#t~ite91=|v_ULTIMATE.start_main_#t~ite91_12|, ~y$w_buff0~0=v_~y$w_buff0~0_46, ~y~0=v_~y~0_45, ULTIMATE.start_main_~#t1647~0.base=|v_ULTIMATE.start_main_~#t1647~0.base_19|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_10, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_8|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_9, ULTIMATE.start_main_#t~ite78=|v_ULTIMATE.start_main_#t~ite78_11|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_17|, ULTIMATE.start_main_#t~ite85=|v_ULTIMATE.start_main_#t~ite85_12|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_60, ULTIMATE.start_main_#t~ite83=|v_ULTIMATE.start_main_#t~ite83_12|, ULTIMATE.start_main_#t~ite81=|v_ULTIMATE.start_main_#t~ite81_12|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_64, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_9|, ~weak$$choice2~0=v_~weak$$choice2~0_47, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_108} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet76, #NULL.offset, ULTIMATE.start_main_#t~ite89, ULTIMATE.start_main_#t~ite87, ULTIMATE.start_main_#t~ite73, ULTIMATE.start_main_#t~ite96, ~y$read_delayed~0, ULTIMATE.start_main_#t~ite71, ULTIMATE.start_main_#t~ite94, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_#t~ite92, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_#t~ite90, ULTIMATE.start_main_~#t1648~0.offset, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1648~0.base, ULTIMATE.start_main_#t~nondet68, ULTIMATE.start_main_#t~ite79, ULTIMATE.start_main_#t~ite77, ULTIMATE.start_main_#t~ite84, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite82, ~y$w_buff1~0, ULTIMATE.start_main_#t~ite80, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_#t~nondet75, ~y$read_delayed_var~0.offset, ULTIMATE.start_main_~#t1647~0.offset, ~y$w_buff0_used~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ULTIMATE.start_main_#t~ite88, ULTIMATE.start_main_#t~ite86, ULTIMATE.start_main_#t~ite74, ULTIMATE.start_main_#t~ite95, ~y$r_buff1_thd1~0, ULTIMATE.start_main_#t~ite72, ULTIMATE.start_main_#t~ite93, ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite91, ~y$w_buff0~0, ~y~0, ULTIMATE.start_main_~#t1647~0.base, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet67, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite78, #NULL.base, ULTIMATE.start_main_#t~ite97, ULTIMATE.start_main_#t~ite85, ~y$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite83, ULTIMATE.start_main_#t~ite81, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:04:53,383 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1350] [1350] L822-1-->L824: Formula: (and (= |v_#valid_23| (store |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t1648~0.offset_10|) (= (store |v_#length_12| |v_ULTIMATE.start_main_~#t1648~0.base_11| 4) |v_#length_11|) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1648~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t1648~0.base_11|)) (= |v_#memory_int_5| (store |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11| (store (select |v_#memory_int_6| |v_ULTIMATE.start_main_~#t1648~0.base_11|) |v_ULTIMATE.start_main_~#t1648~0.offset_10| 1))) (= (select |v_#valid_24| |v_ULTIMATE.start_main_~#t1648~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_24|, #memory_int=|v_#memory_int_6|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet67=|v_ULTIMATE.start_main_#t~nondet67_6|, ULTIMATE.start_main_~#t1648~0.offset=|v_ULTIMATE.start_main_~#t1648~0.offset_10|, #valid=|v_#valid_23|, #memory_int=|v_#memory_int_5|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1648~0.base=|v_ULTIMATE.start_main_~#t1648~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet67, ULTIMATE.start_main_~#t1648~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1648~0.base] because there is no mapped edge [2019-12-18 22:04:53,384 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1320] [1320] L729-2-->L729-5: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-1820947858 256) 0)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-1820947858 256) 0)) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-1820947858| |P0Thread1of1ForFork0_#t~ite3_Out-1820947858|))) (or (and (= ~y~0_In-1820947858 |P0Thread1of1ForFork0_#t~ite3_Out-1820947858|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~y$w_buff1~0_In-1820947858 |P0Thread1of1ForFork0_#t~ite3_Out-1820947858|) (not .cse1) .cse2))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1820947858, ~y$w_buff1~0=~y$w_buff1~0_In-1820947858, ~y~0=~y~0_In-1820947858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1820947858} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1820947858, P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-1820947858|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-1820947858|, ~y$w_buff1~0=~y$w_buff1~0_In-1820947858, ~y~0=~y~0_In-1820947858, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1820947858} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 22:04:53,385 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1302] [1302] L730-->L730-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In-965934580 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-965934580 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-965934580| ~y$w_buff0_used~0_In-965934580)) (and (not .cse0) (not .cse1) (= |P0Thread1of1ForFork0_#t~ite5_Out-965934580| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-965934580, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-965934580} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-965934580|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-965934580, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-965934580} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 22:04:53,386 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1298] [1298] L731-->L731-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff1_used~0_In650664329 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In650664329 256))) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In650664329 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In650664329 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite6_Out650664329| ~y$w_buff1_used~0_In650664329) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P0Thread1of1ForFork0_#t~ite6_Out650664329| 0)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In650664329, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650664329, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In650664329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650664329} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out650664329|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In650664329, ~y$w_buff0_used~0=~y$w_buff0_used~0_In650664329, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In650664329, ~y$w_buff1_used~0=~y$w_buff1_used~0_In650664329} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 22:04:53,387 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1330] [1330] L732-->L732-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd1~0_In861348198 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In861348198 256)))) (or (and (not .cse0) (not .cse1) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out861348198|)) (and (= ~y$r_buff0_thd1~0_In861348198 |P0Thread1of1ForFork0_#t~ite7_Out861348198|) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In861348198, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In861348198} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In861348198, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out861348198|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In861348198} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 22:04:53,388 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1295] [1295] L733-->L733-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-855491485 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In-855491485 256))) (.cse3 (= 0 (mod ~y$r_buff1_thd1~0_In-855491485 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-855491485 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite8_Out-855491485| ~y$r_buff1_thd1~0_In-855491485) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-855491485| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-855491485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-855491485, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-855491485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-855491485} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-855491485, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-855491485, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-855491485|, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-855491485, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-855491485} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 22:04:53,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1314] [1314] L739-2-->L739-5: Formula: (let ((.cse2 (= (mod ~y$w_buff1_used~0_In-386408505 256) 0)) (.cse0 (= |P0Thread1of1ForFork0_#t~ite9_Out-386408505| |P0Thread1of1ForFork0_#t~ite10_Out-386408505|)) (.cse1 (= (mod ~y$r_buff1_thd1~0_In-386408505 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite9_Out-386408505| ~y~0_In-386408505) .cse0 (or .cse1 .cse2)) (and (= |P0Thread1of1ForFork0_#t~ite9_Out-386408505| ~y$w_buff1~0_In-386408505) (not .cse2) .cse0 (not .cse1)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-386408505, ~y$w_buff1~0=~y$w_buff1~0_In-386408505, ~y~0=~y~0_In-386408505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386408505} OutVars{P0Thread1of1ForFork0_#t~ite10=|P0Thread1of1ForFork0_#t~ite10_Out-386408505|, ~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-386408505, P0Thread1of1ForFork0_#t~ite9=|P0Thread1of1ForFork0_#t~ite9_Out-386408505|, ~y$w_buff1~0=~y$w_buff1~0_In-386408505, ~y~0=~y~0_In-386408505, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-386408505} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite10, P0Thread1of1ForFork0_#t~ite9] because there is no mapped edge [2019-12-18 22:04:53,390 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1261] [1261] P1ENTRY-->L4-3: Formula: (and (= 1 v_~x~0_5) (= |v_P1Thread1of1ForFork1_#in~arg.offset_5| v_P1Thread1of1ForFork1_~arg.offset_5) (= 1 v_~y$w_buff0~0_34) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5| 1) (= v_P1Thread1of1ForFork1_~arg.base_5 |v_P1Thread1of1ForFork1_#in~arg.base_5|) (= v_~y$w_buff0_used~0_162 1) (= v_~y$w_buff0~0_35 v_~y$w_buff1~0_32) (= v_~y$w_buff1_used~0_93 v_~y$w_buff0_used~0_163) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|) (= 0 (mod v_~y$w_buff1_used~0_93 256))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_163, ~y$w_buff0~0=v_~y$w_buff0~0_35, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_7, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_5, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_162, ~y$w_buff1~0=v_~y$w_buff1~0_32, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_5, ~y$w_buff0~0=v_~y$w_buff0~0_34, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_5|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_5|, ~x~0=v_~x~0_5, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_93} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-18 22:04:53,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1328] [1328] L771-2-->L771-4: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1851020087 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd2~0_In1851020087 256) 0))) (or (and (= ~y$w_buff1~0_In1851020087 |P1Thread1of1ForFork1_#t~ite17_Out1851020087|) (or .cse0 .cse1)) (and (not .cse0) (= ~y$w_buff0~0_In1851020087 |P1Thread1of1ForFork1_#t~ite17_Out1851020087|) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1851020087, ~y$w_buff1~0=~y$w_buff1~0_In1851020087, ~y$w_buff0~0=~y$w_buff0~0_In1851020087, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851020087} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1851020087, ~y$w_buff1~0=~y$w_buff1~0_In1851020087, ~y$w_buff0~0=~y$w_buff0~0_In1851020087, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1851020087, P1Thread1of1ForFork1_#t~ite17=|P1Thread1of1ForFork1_#t~ite17_Out1851020087|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:04:53,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1231] [1231] L771-4-->L772: Formula: (= v_~y~0_28 |v_P1Thread1of1ForFork1_#t~ite17_8|) InVars {P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_8|} OutVars{P1Thread1of1ForFork1_#t~ite18=|v_P1Thread1of1ForFork1_#t~ite18_7|, ~y~0=v_~y~0_28, P1Thread1of1ForFork1_#t~ite17=|v_P1Thread1of1ForFork1_#t~ite17_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite18, ~y~0, P1Thread1of1ForFork1_#t~ite17] because there is no mapped edge [2019-12-18 22:04:53,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1292] [1292] L776-->L777: Formula: (and (not (= (mod v_~weak$$choice2~0_43 256) 0)) (= v_~y$r_buff0_thd2~0_106 v_~y$r_buff0_thd2~0_105)) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_106, ~weak$$choice2~0=v_~weak$$choice2~0_43} OutVars{P1Thread1of1ForFork1_#t~ite31=|v_P1Thread1of1ForFork1_#t~ite31_9|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_105, P1Thread1of1ForFork1_#t~ite32=|v_P1Thread1of1ForFork1_#t~ite32_10|, P1Thread1of1ForFork1_#t~ite33=|v_P1Thread1of1ForFork1_#t~ite33_8|, ~weak$$choice2~0=v_~weak$$choice2~0_43} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite31, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite32, P1Thread1of1ForFork1_#t~ite33] because there is no mapped edge [2019-12-18 22:04:53,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1312] [1312] L779-->L779-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1867856274 256) 0))) (or (and .cse0 (= |P1Thread1of1ForFork1_#t~ite37_Out-1867856274| ~y~0_In-1867856274)) (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite37_Out-1867856274| ~y$mem_tmp~0_In-1867856274)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1867856274, ~y$flush_delayed~0=~y$flush_delayed~0_In-1867856274, ~y~0=~y~0_In-1867856274} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1867856274, ~y$flush_delayed~0=~y$flush_delayed~0_In-1867856274, ~y~0=~y~0_In-1867856274, P1Thread1of1ForFork1_#t~ite37=|P1Thread1of1ForFork1_#t~ite37_Out-1867856274|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-18 22:04:53,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1306] [1306] L787-2-->L787-5: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In160571808 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In160571808 256))) (.cse2 (= |P1Thread1of1ForFork1_#t~ite41_Out160571808| |P1Thread1of1ForFork1_#t~ite40_Out160571808|))) (or (and (not .cse0) (not .cse1) .cse2 (= ~y$w_buff0~0_In160571808 |P1Thread1of1ForFork1_#t~ite40_Out160571808|)) (and (= |P1Thread1of1ForFork1_#t~ite40_Out160571808| ~y$w_buff1~0_In160571808) (or .cse1 .cse0) .cse2))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In160571808, ~y$w_buff1~0=~y$w_buff1~0_In160571808, ~y$w_buff0~0=~y$w_buff0~0_In160571808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In160571808} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In160571808, ~y$w_buff1~0=~y$w_buff1~0_In160571808, P1Thread1of1ForFork1_#t~ite41=|P1Thread1of1ForFork1_#t~ite41_Out160571808|, P1Thread1of1ForFork1_#t~ite40=|P1Thread1of1ForFork1_#t~ite40_Out160571808|, ~y$w_buff0~0=~y$w_buff0~0_In160571808, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In160571808} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite41, P1Thread1of1ForFork1_#t~ite40] because there is no mapped edge [2019-12-18 22:04:53,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1227] [1227] L792-->L793: Formula: (and (= v_~y$r_buff0_thd2~0_81 v_~y$r_buff0_thd2~0_80) (not (= (mod v_~weak$$choice2~0_41 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_81, ~weak$$choice2~0=v_~weak$$choice2~0_41} OutVars{~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_80, P1Thread1of1ForFork1_#t~ite56=|v_P1Thread1of1ForFork1_#t~ite56_9|, P1Thread1of1ForFork1_#t~ite55=|v_P1Thread1of1ForFork1_#t~ite55_11|, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_10|, ~weak$$choice2~0=v_~weak$$choice2~0_41} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite56, P1Thread1of1ForFork1_#t~ite55, P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-18 22:04:53,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1321] [1321] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In1406366922 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite60_Out1406366922| ~y~0_In1406366922) .cse0) (and (= |P1Thread1of1ForFork1_#t~ite60_Out1406366922| ~y$mem_tmp~0_In1406366922) (not .cse0)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In1406366922, ~y$flush_delayed~0=~y$flush_delayed~0_In1406366922, ~y~0=~y~0_In1406366922} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In1406366922, P1Thread1of1ForFork1_#t~ite60=|P1Thread1of1ForFork1_#t~ite60_Out1406366922|, ~y$flush_delayed~0=~y$flush_delayed~0_In1406366922, ~y~0=~y~0_In1406366922} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite60] because there is no mapped edge [2019-12-18 22:04:53,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1313] [1313] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1386232619 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1386232619 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1386232619 |P1Thread1of1ForFork1_#t~ite63_Out-1386232619|)) (and (= |P1Thread1of1ForFork1_#t~ite63_Out-1386232619| 0) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1386232619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1386232619} OutVars{P1Thread1of1ForFork1_#t~ite63=|P1Thread1of1ForFork1_#t~ite63_Out-1386232619|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1386232619, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1386232619} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite63] because there is no mapped edge [2019-12-18 22:04:53,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1297] [1297] L740-->L740-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In2071585635 256))) (.cse0 (= 0 (mod ~y$r_buff0_thd1~0_In2071585635 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite11_Out2071585635|) (not .cse1)) (and (= ~y$w_buff0_used~0_In2071585635 |P0Thread1of1ForFork0_#t~ite11_Out2071585635|) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In2071585635, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2071585635} OutVars{P0Thread1of1ForFork0_#t~ite11=|P0Thread1of1ForFork0_#t~ite11_Out2071585635|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In2071585635, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In2071585635} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite11] because there is no mapped edge [2019-12-18 22:04:53,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1337] [1337] L801-->L801-2: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd2~0_In-280740696 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-280740696 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In-280740696 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd2~0_In-280740696 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In-280740696 |P1Thread1of1ForFork1_#t~ite64_Out-280740696|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork1_#t~ite64_Out-280740696|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-280740696, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-280740696, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-280740696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-280740696} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-280740696, P1Thread1of1ForFork1_#t~ite64=|P1Thread1of1ForFork1_#t~ite64_Out-280740696|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-280740696, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-280740696, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-280740696} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite64] because there is no mapped edge [2019-12-18 22:04:53,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1316] [1316] L802-->L803: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In-1501253472 256))) (.cse1 (= (mod ~y$w_buff0_used~0_In-1501253472 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 ~y$r_buff0_thd2~0_Out-1501253472)) (and (= ~y$r_buff0_thd2~0_In-1501253472 ~y$r_buff0_thd2~0_Out-1501253472) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1501253472, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1501253472} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-1501253472, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1501253472, P1Thread1of1ForFork1_#t~ite65=|P1Thread1of1ForFork1_#t~ite65_Out-1501253472|} AuxVars[] AssignedVars[~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite65] because there is no mapped edge [2019-12-18 22:04:53,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1325] [1325] L803-->L803-2: Formula: (let ((.cse3 (= 0 (mod ~y$r_buff0_thd2~0_In386295385 256))) (.cse2 (= 0 (mod ~y$w_buff0_used~0_In386295385 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd2~0_In386295385 256))) (.cse1 (= (mod ~y$w_buff1_used~0_In386295385 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite66_Out386295385| ~y$r_buff1_thd2~0_In386295385)) (and (= |P1Thread1of1ForFork1_#t~ite66_Out386295385| 0) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In386295385, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386295385, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In386295385, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386295385} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In386295385, ~y$w_buff0_used~0=~y$w_buff0_used~0_In386295385, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In386295385, P1Thread1of1ForFork1_#t~ite66=|P1Thread1of1ForFork1_#t~ite66_Out386295385|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In386295385} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite66] because there is no mapped edge [2019-12-18 22:04:53,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1355] [1355] L803-2-->P1EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~y$r_buff1_thd2~0_53 |v_P1Thread1of1ForFork1_#t~ite66_8|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_53, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork1_#t~ite66=|v_P1Thread1of1ForFork1_#t~ite66_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite66, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 22:04:53,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1310] [1310] L741-->L741-2: Formula: (let ((.cse3 (= (mod ~y$r_buff1_thd1~0_In1676608819 256) 0)) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In1676608819 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1676608819 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd1~0_In1676608819 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$w_buff1_used~0_In1676608819 |P0Thread1of1ForFork0_#t~ite12_Out1676608819|)) (and (= 0 |P0Thread1of1ForFork0_#t~ite12_Out1676608819|) (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1676608819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1676608819, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1676608819, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1676608819} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In1676608819, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1676608819, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In1676608819, P0Thread1of1ForFork0_#t~ite12=|P0Thread1of1ForFork0_#t~ite12_Out1676608819|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1676608819} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite12] because there is no mapped edge [2019-12-18 22:04:53,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1304] [1304] L742-->L742-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd1~0_In-340493618 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-340493618 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite13_Out-340493618|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$r_buff0_thd1~0_In-340493618 |P0Thread1of1ForFork0_#t~ite13_Out-340493618|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-340493618, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-340493618} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-340493618, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-340493618, P0Thread1of1ForFork0_#t~ite13=|P0Thread1of1ForFork0_#t~ite13_Out-340493618|} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite13] because there is no mapped edge [2019-12-18 22:04:53,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1338] [1338] L743-->L743-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd1~0_In-1088154611 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1088154611 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd1~0_In-1088154611 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1088154611 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite14_Out-1088154611| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P0Thread1of1ForFork0_#t~ite14_Out-1088154611| ~y$r_buff1_thd1~0_In-1088154611)))) InVars {~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1088154611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1088154611, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1088154611, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088154611} OutVars{~y$r_buff1_thd1~0=~y$r_buff1_thd1~0_In-1088154611, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1088154611, ~y$r_buff0_thd1~0=~y$r_buff0_thd1~0_In-1088154611, P0Thread1of1ForFork0_#t~ite14=|P0Thread1of1ForFork0_#t~ite14_Out-1088154611|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1088154611} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 22:04:53,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1340] [1340] L743-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~y$r_buff1_thd1~0_23 |v_P0Thread1of1ForFork0_#t~ite14_8|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_9 (+ v_~__unbuffered_cnt~0_10 1))) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_8|} OutVars{~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_23, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P0Thread1of1ForFork0_#t~ite14=|v_P0Thread1of1ForFork0_#t~ite14_7|} AuxVars[] AssignedVars[~y$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_#t~ite14] because there is no mapped edge [2019-12-18 22:04:53,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1274] [1274] L824-1-->L830: Formula: (and (= v_~__unbuffered_cnt~0_8 2) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8} OutVars{ULTIMATE.start_main_#t~nondet68=|v_ULTIMATE.start_main_#t~nondet68_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet68, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 22:04:53,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1336] [1336] L830-2-->L830-4: Formula: (let ((.cse0 (= (mod ~y$w_buff1_used~0_In-634045962 256) 0)) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-634045962 256)))) (or (and (= ~y~0_In-634045962 |ULTIMATE.start_main_#t~ite69_Out-634045962|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite69_Out-634045962| ~y$w_buff1~0_In-634045962) (not .cse1)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-634045962, ~y~0=~y~0_In-634045962, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-634045962, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-634045962} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-634045962, ULTIMATE.start_main_#t~ite69=|ULTIMATE.start_main_#t~ite69_Out-634045962|, ~y~0=~y~0_In-634045962, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-634045962, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-634045962} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite69] because there is no mapped edge [2019-12-18 22:04:53,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1254] [1254] L830-4-->L831: Formula: (= v_~y~0_32 |v_ULTIMATE.start_main_#t~ite69_8|) InVars {ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_8|} OutVars{ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_7|, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_7|, ~y~0=v_~y~0_32} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70, ULTIMATE.start_main_#t~ite69, ~y~0] because there is no mapped edge [2019-12-18 22:04:53,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1311] [1311] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-1574696456 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1574696456 256)))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite71_Out-1574696456|) (not .cse1)) (and (or .cse1 .cse0) (= ~y$w_buff0_used~0_In-1574696456 |ULTIMATE.start_main_#t~ite71_Out-1574696456|)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1574696456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1574696456} OutVars{ULTIMATE.start_main_#t~ite71=|ULTIMATE.start_main_#t~ite71_Out-1574696456|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1574696456, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1574696456} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite71] because there is no mapped edge [2019-12-18 22:04:53,424 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1335] [1335] L832-->L832-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In431160844 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In431160844 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In431160844 256) 0)) (.cse3 (= (mod ~y$r_buff1_thd0~0_In431160844 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite72_Out431160844| 0)) (and (= |ULTIMATE.start_main_#t~ite72_Out431160844| ~y$w_buff1_used~0_In431160844) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In431160844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In431160844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In431160844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In431160844} OutVars{ULTIMATE.start_main_#t~ite72=|ULTIMATE.start_main_#t~ite72_Out431160844|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In431160844, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In431160844, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In431160844, ~y$w_buff1_used~0=~y$w_buff1_used~0_In431160844} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite72] because there is no mapped edge [2019-12-18 22:04:53,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1300] [1300] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1574951622 256) 0)) (.cse0 (= (mod ~y$w_buff0_used~0_In1574951622 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite73_Out1574951622| ~y$r_buff0_thd0~0_In1574951622) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite73_Out1574951622| 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1574951622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1574951622} OutVars{ULTIMATE.start_main_#t~ite73=|ULTIMATE.start_main_#t~ite73_Out1574951622|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1574951622, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1574951622} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite73] because there is no mapped edge [2019-12-18 22:04:53,426 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1332] [1332] L834-->L834-2: Formula: (let ((.cse3 (= (mod ~y$w_buff1_used~0_In-1831532910 256) 0)) (.cse2 (= (mod ~y$r_buff1_thd0~0_In-1831532910 256) 0)) (.cse0 (= 0 (mod ~y$r_buff0_thd0~0_In-1831532910 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In-1831532910 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite74_Out-1831532910|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite74_Out-1831532910| ~y$r_buff1_thd0~0_In-1831532910)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1831532910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1831532910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1831532910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1831532910} OutVars{ULTIMATE.start_main_#t~ite74=|ULTIMATE.start_main_#t~ite74_Out-1831532910|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1831532910, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1831532910, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1831532910, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1831532910} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite74] because there is no mapped edge [2019-12-18 22:04:53,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1296] [1296] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In-1085212316 256) 0))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-1085212316 |ULTIMATE.start_main_#t~ite97_Out-1085212316|)) (and .cse0 (= ~y~0_In-1085212316 |ULTIMATE.start_main_#t~ite97_Out-1085212316|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-1085212316, ~y$flush_delayed~0=~y$flush_delayed~0_In-1085212316, ~y~0=~y~0_In-1085212316} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-1085212316, ~y$flush_delayed~0=~y$flush_delayed~0_In-1085212316, ~y~0=~y~0_In-1085212316, ULTIMATE.start_main_#t~ite97=|ULTIMATE.start_main_#t~ite97_Out-1085212316|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-18 22:04:53,439 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1379] [1379] L849-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (= 0 v_~y$flush_delayed~0_18) (= v_~y~0_41 |v_ULTIMATE.start_main_#t~ite97_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_11 256))) InVars {~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_12|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~y~0=v_~y~0_41, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|, ULTIMATE.start_main_#t~ite97=|v_ULTIMATE.start_main_#t~ite97_11|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ~y$flush_delayed~0, ~y~0, ULTIMATE.start___VERIFIER_assert_#in~expression, ULTIMATE.start_main_#t~ite97] because there is no mapped edge [2019-12-18 22:04:53,552 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 10:04:53 BasicIcfg [2019-12-18 22:04:53,552 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 22:04:53,557 INFO L168 Benchmark]: Toolchain (without parser) took 74613.46 ms. Allocated memory was 140.0 MB in the beginning and 2.7 GB in the end (delta: 2.6 GB). Free memory was 103.3 MB in the beginning and 1.0 GB in the end (delta: -937.4 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:04:53,558 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-18 22:04:53,558 INFO L168 Benchmark]: CACSL2BoogieTranslator took 863.29 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.9 MB in the beginning and 155.1 MB in the end (delta: -52.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:53,559 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 151.4 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:53,559 INFO L168 Benchmark]: Boogie Preprocessor took 51.52 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:53,560 INFO L168 Benchmark]: RCFGBuilder took 1131.27 ms. Allocated memory was 203.9 MB in the beginning and 236.5 MB in the end (delta: 32.5 MB). Free memory was 148.6 MB in the beginning and 189.2 MB in the end (delta: -40.6 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. [2019-12-18 22:04:53,562 INFO L168 Benchmark]: TraceAbstraction took 72486.34 ms. Allocated memory was 236.5 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 189.2 MB in the beginning and 1.0 GB in the end (delta: -851.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-18 22:04:53,569 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.41 ms. Allocated memory is still 140.0 MB. Free memory is still 122.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 863.29 ms. Allocated memory was 140.0 MB in the beginning and 203.9 MB in the end (delta: 64.0 MB). Free memory was 102.9 MB in the beginning and 155.1 MB in the end (delta: -52.3 MB). Peak memory consumption was 26.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.80 ms. Allocated memory is still 203.9 MB. Free memory was 155.1 MB in the beginning and 151.4 MB in the end (delta: 3.7 MB). Peak memory consumption was 3.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.52 ms. Allocated memory is still 203.9 MB. Free memory was 151.4 MB in the beginning and 148.6 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1131.27 ms. Allocated memory was 203.9 MB in the beginning and 236.5 MB in the end (delta: 32.5 MB). Free memory was 148.6 MB in the beginning and 189.2 MB in the end (delta: -40.6 MB). Peak memory consumption was 62.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 72486.34 ms. Allocated memory was 236.5 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 189.2 MB in the beginning and 1.0 GB in the end (delta: -851.5 MB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 244 ProgramPointsBefore, 159 ProgramPointsAfterwards, 326 TransitionsBefore, 198 TransitionsAfterwards, 49222 CoEnabledTransitionPairs, 7 FixpointIterations, 30 TrivialSequentialCompositions, 30 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 76 ConcurrentYvCompositions, 46 ChoiceCompositions, 15325 VarBasedMoverChecksPositive, 324 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 300794 CheckedPairsTotal, 136 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1647, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L726] 1 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 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) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L824] FCALL, FORK 0 pthread_create(&t1648, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L729] 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) [L730] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L731] 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 [L732] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L733] 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 [L736] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] 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) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=2, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=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] [L761] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L762] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L763] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L764] 2 y$r_buff0_thd2 = (_Bool)1 [L767] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L768] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L769] 2 y$flush_delayed = weak$$choice2 [L770] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L771] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L772] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L773] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L773] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L774] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L774] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L775] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L775] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L777] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L777] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L778] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L779] 2 y = y$flush_delayed ? y$mem_tmp : y [L780] 2 y$flush_delayed = (_Bool)0 [L783] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 2 y$flush_delayed = weak$$choice2 [L786] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L787] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L788] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L788] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L789] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L789] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L790] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L790] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L791] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L791] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L793] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L794] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=1, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L795] 2 y = y$flush_delayed ? y$mem_tmp : y [L796] 2 y$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y)=2, y$w_buff1=0, y$w_buff1_used=0, y$w_buff1_used && y$r_buff1_thd1 ? y$w_buff1 : y=2] [L799] 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) [L800] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L739] 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) [L801] 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 [L740] 1 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used [L741] 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 [L742] 1 y$r_buff0_thd1 = y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1 [L830] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=2, y$flush_delayed=0, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L831] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L832] 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 [L833] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 [L834] 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 [L837] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L838] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L839] 0 y$flush_delayed = weak$$choice2 [L840] 0 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] EXPR 0 !y$w_buff0_used || !y$r_buff0_thd0 && !y$w_buff1_used || !y$r_buff0_thd0 && !y$r_buff1_thd0 ? y : (y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : y$w_buff1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L841] 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) [L842] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L842] 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)) [L843] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L843] 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)) [L844] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L844] 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)) [L845] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L845] 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)) [L846] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L846] 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)) [L847] 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)) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L847] 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)) [L848] 0 main$tmp_guard1 = !(y == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 1 && __unbuffered_p1_EBX == 1) VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=1, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=4, weak$$choice2=1, x=1, y=2, y$flush_delayed=1, y$mem_tmp=2, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 238 locations, 2 error locations. Result: UNSAFE, OverallTime: 72.1s, OverallIterations: 26, TraceHistogramMax: 1, AutomataDifference: 28.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8367 SDtfs, 11361 SDslu, 31803 SDs, 0 SdLazy, 20318 SolverSat, 575 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 424 GetRequests, 60 SyntacticMatches, 71 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=135155occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 22.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 24746 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.3s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 2095 NumberOfCodeBlocks, 2095 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1972 ConstructedInterpolants, 0 QuantifiedInterpolants, 682288 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...