/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/mix030_tso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 21:06:33,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 21:06:33,489 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 21:06:33,501 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 21:06:33,501 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 21:06:33,502 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 21:06:33,503 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 21:06:33,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 21:06:33,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 21:06:33,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 21:06:33,509 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 21:06:33,510 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 21:06:33,510 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 21:06:33,511 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 21:06:33,512 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 21:06:33,513 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 21:06:33,514 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 21:06:33,515 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 21:06:33,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 21:06:33,518 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 21:06:33,520 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 21:06:33,521 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 21:06:33,522 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 21:06:33,523 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 21:06:33,526 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 21:06:33,526 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 21:06:33,526 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 21:06:33,527 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 21:06:33,528 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 21:06:33,529 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 21:06:33,531 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 21:06:33,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 21:06:33,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 21:06:33,533 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 21:06:33,537 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 21:06:33,539 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 21:06:33,540 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 21:06:33,540 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 21:06:33,540 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 21:06:33,541 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 21:06:33,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 21:06:33,546 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 21:06:33,567 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 21:06:33,567 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 21:06:33,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 21:06:33,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 21:06:33,569 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 21:06:33,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 21:06:33,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 21:06:33,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 21:06:33,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 21:06:33,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 21:06:33,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 21:06:33,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 21:06:33,572 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 21:06:33,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 21:06:33,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 21:06:33,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 21:06:33,573 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 21:06:33,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 21:06:33,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 21:06:33,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 21:06:33,574 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 21:06:33,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:06:33,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 21:06:33,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 21:06:33,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 21:06:33,575 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 21:06:33,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 21:06:33,575 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-18 21:06:33,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 21:06:33,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 21:06:33,864 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 21:06:33,883 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 21:06:33,887 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 21:06:33,888 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 21:06:33,889 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 21:06:33,890 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-18 21:06:33,975 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffede932/b8d688183eec4b2bbd574870659747e9/FLAG5dc1b7b2f [2019-12-18 21:06:34,548 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 21:06:34,549 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix030_tso.opt.i [2019-12-18 21:06:34,570 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffede932/b8d688183eec4b2bbd574870659747e9/FLAG5dc1b7b2f [2019-12-18 21:06:34,881 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5ffede932/b8d688183eec4b2bbd574870659747e9 [2019-12-18 21:06:34,889 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 21:06:34,891 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 21:06:34,892 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 21:06:34,892 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 21:06:34,896 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 21:06:34,897 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:06:34" (1/1) ... [2019-12-18 21:06:34,900 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cae7156 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:34, skipping insertion in model container [2019-12-18 21:06:34,900 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 09:06:34" (1/1) ... [2019-12-18 21:06:34,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 21:06:34,978 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 21:06:35,491 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:06:35,504 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 21:06:35,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 21:06:35,663 INFO L208 MainTranslator]: Completed translation [2019-12-18 21:06:35,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35 WrapperNode [2019-12-18 21:06:35,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 21:06:35,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 21:06:35,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 21:06:35,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 21:06:35,674 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,709 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,752 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 21:06:35,753 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 21:06:35,753 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 21:06:35,753 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 21:06:35,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,771 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,772 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,784 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,789 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,794 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... [2019-12-18 21:06:35,800 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 21:06:35,801 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 21:06:35,801 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 21:06:35,801 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 21:06:35,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 21:06:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 21:06:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 21:06:35,872 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 21:06:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 21:06:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 21:06:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 21:06:35,873 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 21:06:35,873 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 21:06:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 21:06:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 21:06:35,874 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-18 21:06:35,874 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-18 21:06:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 21:06:35,875 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 21:06:35,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 21:06:35,877 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 21:06:36,821 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 21:06:36,821 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 21:06:36,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:06:36 BoogieIcfgContainer [2019-12-18 21:06:36,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 21:06:36,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 21:06:36,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 21:06:36,827 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 21:06:36,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 09:06:34" (1/3) ... [2019-12-18 21:06:36,828 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165321e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:06:36, skipping insertion in model container [2019-12-18 21:06:36,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 09:06:35" (2/3) ... [2019-12-18 21:06:36,829 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@165321e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 09:06:36, skipping insertion in model container [2019-12-18 21:06:36,829 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 09:06:36" (3/3) ... [2019-12-18 21:06:36,831 INFO L109 eAbstractionObserver]: Analyzing ICFG mix030_tso.opt.i [2019-12-18 21:06:36,840 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 21:06:36,841 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 21:06:36,848 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 21:06:36,849 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 21:06:36,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,893 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,894 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,895 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,895 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,896 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,896 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,896 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,897 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,898 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,899 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,900 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,901 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,902 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,904 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,904 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,905 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,905 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,905 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,906 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,907 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,908 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,909 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,910 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,911 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,912 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,913 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,914 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,915 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,916 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,917 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,918 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,919 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,920 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,921 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,922 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,923 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,924 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,925 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,926 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,927 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,928 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,929 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,933 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,933 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,936 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,936 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,937 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,938 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,939 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,939 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,940 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,950 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,951 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,951 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,951 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,952 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,953 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,954 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,955 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,955 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~nondet9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,956 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,957 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 21:06:36,972 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-18 21:06:36,992 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 21:06:36,992 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 21:06:36,992 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 21:06:36,992 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 21:06:36,992 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 21:06:36,992 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 21:06:36,993 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 21:06:36,993 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 21:06:37,013 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 221 places, 270 transitions [2019-12-18 21:06:37,015 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-18 21:06:37,147 INFO L126 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-18 21:06:37,147 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:06:37,178 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 12/214 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-18 21:06:37,226 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 221 places, 270 transitions [2019-12-18 21:06:37,288 INFO L126 PetriNetUnfolder]: 62/266 cut-off events. [2019-12-18 21:06:37,289 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 21:06:37,303 INFO L76 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 266 events. 62/266 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 528 event pairs. 12/214 useless extension candidates. Maximal degree in co-relation 235. Up to 2 conditions per place. [2019-12-18 21:06:37,342 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 28796 [2019-12-18 21:06:37,343 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-18 21:06:41,180 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 93 [2019-12-18 21:06:41,314 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 91 [2019-12-18 21:06:41,456 INFO L206 etLargeBlockEncoding]: Checked pairs total: 156307 [2019-12-18 21:06:41,456 INFO L214 etLargeBlockEncoding]: Total number of compositions: 128 [2019-12-18 21:06:41,460 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 126 places, 148 transitions [2019-12-18 21:06:55,694 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 114934 states. [2019-12-18 21:06:55,696 INFO L276 IsEmpty]: Start isEmpty. Operand 114934 states. [2019-12-18 21:06:55,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-18 21:06:55,704 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:06:55,704 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:06:55,705 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:06:55,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:06:55,711 INFO L82 PathProgramCache]: Analyzing trace with hash 1884154213, now seen corresponding path program 1 times [2019-12-18 21:06:55,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:06:55,719 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797400332] [2019-12-18 21:06:55,719 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:06:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:06:55,971 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 21:06:55,971 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797400332] [2019-12-18 21:06:55,972 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:06:55,972 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 21:06:55,973 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188754622] [2019-12-18 21:06:55,977 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:06:55,978 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:06:55,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:06:55,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:06:55,995 INFO L87 Difference]: Start difference. First operand 114934 states. Second operand 3 states. [2019-12-18 21:06:59,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:06:59,726 INFO L93 Difference]: Finished difference Result 114574 states and 521540 transitions. [2019-12-18 21:06:59,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:06:59,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-18 21:06:59,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:00,518 INFO L225 Difference]: With dead ends: 114574 [2019-12-18 21:07:00,518 INFO L226 Difference]: Without dead ends: 112286 [2019-12-18 21:07:00,519 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 21:07:02,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112286 states. [2019-12-18 21:07:05,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112286 to 112286. [2019-12-18 21:07:05,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112286 states. [2019-12-18 21:07:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112286 states to 112286 states and 511660 transitions. [2019-12-18 21:07:06,532 INFO L78 Accepts]: Start accepts. Automaton has 112286 states and 511660 transitions. Word has length 9 [2019-12-18 21:07:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:06,533 INFO L462 AbstractCegarLoop]: Abstraction has 112286 states and 511660 transitions. [2019-12-18 21:07:06,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 112286 states and 511660 transitions. [2019-12-18 21:07:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:07:06,539 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:06,539 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:06,540 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:06,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash 271728690, now seen corresponding path program 1 times [2019-12-18 21:07:06,541 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:06,542 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941546289] [2019-12-18 21:07:06,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:06,691 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 21:07:06,692 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941546289] [2019-12-18 21:07:06,692 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:06,692 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:06,692 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158467435] [2019-12-18 21:07:06,694 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:06,694 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:06,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:06,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:06,695 INFO L87 Difference]: Start difference. First operand 112286 states and 511660 transitions. Second operand 4 states. [2019-12-18 21:07:11,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:11,978 INFO L93 Difference]: Finished difference Result 180442 states and 791232 transitions. [2019-12-18 21:07:11,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:11,979 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-18 21:07:11,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:13,545 INFO L225 Difference]: With dead ends: 180442 [2019-12-18 21:07:13,546 INFO L226 Difference]: Without dead ends: 180414 [2019-12-18 21:07:13,547 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 21:07:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180414 states. [2019-12-18 21:07:23,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180414 to 174914. [2019-12-18 21:07:23,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174914 states. [2019-12-18 21:07:24,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174914 states to 174914 states and 771276 transitions. [2019-12-18 21:07:24,500 INFO L78 Accepts]: Start accepts. Automaton has 174914 states and 771276 transitions. Word has length 15 [2019-12-18 21:07:24,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:24,500 INFO L462 AbstractCegarLoop]: Abstraction has 174914 states and 771276 transitions. [2019-12-18 21:07:24,500 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:24,500 INFO L276 IsEmpty]: Start isEmpty. Operand 174914 states and 771276 transitions. [2019-12-18 21:07:24,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-18 21:07:24,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:24,503 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:24,504 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:24,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:24,504 INFO L82 PathProgramCache]: Analyzing trace with hash -801209711, now seen corresponding path program 1 times [2019-12-18 21:07:24,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:24,505 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803502705] [2019-12-18 21:07:24,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:24,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:24,562 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 21:07:24,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803502705] [2019-12-18 21:07:24,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:24,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:24,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397095738] [2019-12-18 21:07:24,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:24,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:24,564 INFO L87 Difference]: Start difference. First operand 174914 states and 771276 transitions. Second operand 3 states. [2019-12-18 21:07:25,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:25,193 INFO L93 Difference]: Finished difference Result 135221 states and 552590 transitions. [2019-12-18 21:07:25,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:25,193 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-18 21:07:25,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:32,207 INFO L225 Difference]: With dead ends: 135221 [2019-12-18 21:07:32,207 INFO L226 Difference]: Without dead ends: 135221 [2019-12-18 21:07:32,208 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 21:07:33,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135221 states. [2019-12-18 21:07:36,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135221 to 135221. [2019-12-18 21:07:36,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135221 states. [2019-12-18 21:07:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135221 states to 135221 states and 552590 transitions. [2019-12-18 21:07:36,659 INFO L78 Accepts]: Start accepts. Automaton has 135221 states and 552590 transitions. Word has length 15 [2019-12-18 21:07:36,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:36,659 INFO L462 AbstractCegarLoop]: Abstraction has 135221 states and 552590 transitions. [2019-12-18 21:07:36,659 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 135221 states and 552590 transitions. [2019-12-18 21:07:36,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-18 21:07:36,661 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:36,661 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:36,661 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:36,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:36,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1092979513, now seen corresponding path program 1 times [2019-12-18 21:07:36,662 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:36,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524100619] [2019-12-18 21:07:36,663 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:36,718 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 21:07:36,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524100619] [2019-12-18 21:07:36,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:36,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 21:07:36,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365392252] [2019-12-18 21:07:36,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:36,720 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:36,720 INFO L87 Difference]: Start difference. First operand 135221 states and 552590 transitions. Second operand 4 states. [2019-12-18 21:07:36,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:36,932 INFO L93 Difference]: Finished difference Result 52792 states and 180847 transitions. [2019-12-18 21:07:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:07:36,932 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-18 21:07:36,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:37,049 INFO L225 Difference]: With dead ends: 52792 [2019-12-18 21:07:37,050 INFO L226 Difference]: Without dead ends: 52792 [2019-12-18 21:07:37,050 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 21:07:38,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52792 states. [2019-12-18 21:07:39,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52792 to 52792. [2019-12-18 21:07:39,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52792 states. [2019-12-18 21:07:39,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52792 states to 52792 states and 180847 transitions. [2019-12-18 21:07:39,155 INFO L78 Accepts]: Start accepts. Automaton has 52792 states and 180847 transitions. Word has length 16 [2019-12-18 21:07:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:39,156 INFO L462 AbstractCegarLoop]: Abstraction has 52792 states and 180847 transitions. [2019-12-18 21:07:39,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 52792 states and 180847 transitions. [2019-12-18 21:07:39,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-18 21:07:39,157 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:39,157 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 21:07:39,158 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:39,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:39,158 INFO L82 PathProgramCache]: Analyzing trace with hash -551676406, now seen corresponding path program 1 times [2019-12-18 21:07:39,158 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:39,159 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948356843] [2019-12-18 21:07:39,159 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:39,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:39,213 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 21:07:39,213 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948356843] [2019-12-18 21:07:39,214 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:39,214 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:39,214 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859744964] [2019-12-18 21:07:39,214 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:39,215 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:39,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:39,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:39,215 INFO L87 Difference]: Start difference. First operand 52792 states and 180847 transitions. Second operand 5 states. [2019-12-18 21:07:39,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:39,293 INFO L93 Difference]: Finished difference Result 6966 states and 19963 transitions. [2019-12-18 21:07:39,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:39,294 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-12-18 21:07:39,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:39,308 INFO L225 Difference]: With dead ends: 6966 [2019-12-18 21:07:39,309 INFO L226 Difference]: Without dead ends: 6966 [2019-12-18 21:07:39,309 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:39,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6966 states. [2019-12-18 21:07:39,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6966 to 6966. [2019-12-18 21:07:39,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6966 states. [2019-12-18 21:07:39,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6966 states to 6966 states and 19963 transitions. [2019-12-18 21:07:39,437 INFO L78 Accepts]: Start accepts. Automaton has 6966 states and 19963 transitions. Word has length 17 [2019-12-18 21:07:39,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:39,438 INFO L462 AbstractCegarLoop]: Abstraction has 6966 states and 19963 transitions. [2019-12-18 21:07:39,438 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:39,438 INFO L276 IsEmpty]: Start isEmpty. Operand 6966 states and 19963 transitions. [2019-12-18 21:07:39,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-18 21:07:39,446 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:39,446 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] [2019-12-18 21:07:39,446 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:39,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:39,447 INFO L82 PathProgramCache]: Analyzing trace with hash -659172678, now seen corresponding path program 1 times [2019-12-18 21:07:39,447 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:39,447 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363529987] [2019-12-18 21:07:39,447 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:39,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:39,545 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 21:07:39,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363529987] [2019-12-18 21:07:39,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:39,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:07:39,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325329739] [2019-12-18 21:07:39,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:07:39,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:39,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:07:39,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:39,548 INFO L87 Difference]: Start difference. First operand 6966 states and 19963 transitions. Second operand 6 states. [2019-12-18 21:07:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:39,604 INFO L93 Difference]: Finished difference Result 3829 states and 12074 transitions. [2019-12-18 21:07:39,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:07:39,604 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-18 21:07:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:39,612 INFO L225 Difference]: With dead ends: 3829 [2019-12-18 21:07:39,613 INFO L226 Difference]: Without dead ends: 3829 [2019-12-18 21:07:39,613 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:39,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3829 states. [2019-12-18 21:07:39,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3829 to 3633. [2019-12-18 21:07:39,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3633 states. [2019-12-18 21:07:39,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3633 states to 3633 states and 11514 transitions. [2019-12-18 21:07:39,670 INFO L78 Accepts]: Start accepts. Automaton has 3633 states and 11514 transitions. Word has length 29 [2019-12-18 21:07:39,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:39,670 INFO L462 AbstractCegarLoop]: Abstraction has 3633 states and 11514 transitions. [2019-12-18 21:07:39,670 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:07:39,670 INFO L276 IsEmpty]: Start isEmpty. Operand 3633 states and 11514 transitions. [2019-12-18 21:07:39,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:07:39,680 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:39,680 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] [2019-12-18 21:07:39,680 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:39,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:39,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1560837385, now seen corresponding path program 1 times [2019-12-18 21:07:39,681 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:39,681 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518808706] [2019-12-18 21:07:39,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:39,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:39,817 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 21:07:39,818 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518808706] [2019-12-18 21:07:39,818 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:39,818 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:07:39,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928083612] [2019-12-18 21:07:39,819 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:07:39,819 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:39,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:07:39,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:39,820 INFO L87 Difference]: Start difference. First operand 3633 states and 11514 transitions. Second operand 6 states. [2019-12-18 21:07:40,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:40,485 INFO L93 Difference]: Finished difference Result 5490 states and 17220 transitions. [2019-12-18 21:07:40,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:07:40,486 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 21:07:40,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:40,496 INFO L225 Difference]: With dead ends: 5490 [2019-12-18 21:07:40,497 INFO L226 Difference]: Without dead ends: 5490 [2019-12-18 21:07:40,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 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 21:07:40,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5490 states. [2019-12-18 21:07:40,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5490 to 4005. [2019-12-18 21:07:40,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4005 states. [2019-12-18 21:07:40,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4005 states to 4005 states and 12730 transitions. [2019-12-18 21:07:40,707 INFO L78 Accepts]: Start accepts. Automaton has 4005 states and 12730 transitions. Word has length 74 [2019-12-18 21:07:40,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:40,708 INFO L462 AbstractCegarLoop]: Abstraction has 4005 states and 12730 transitions. [2019-12-18 21:07:40,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:07:40,708 INFO L276 IsEmpty]: Start isEmpty. Operand 4005 states and 12730 transitions. [2019-12-18 21:07:40,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:07:40,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:40,717 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] [2019-12-18 21:07:40,717 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:40,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:40,718 INFO L82 PathProgramCache]: Analyzing trace with hash 1440786031, now seen corresponding path program 2 times [2019-12-18 21:07:40,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:40,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830692144] [2019-12-18 21:07:40,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:40,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:40,867 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 21:07:40,869 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830692144] [2019-12-18 21:07:40,869 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:40,869 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 21:07:40,869 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6634334] [2019-12-18 21:07:40,870 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:40,870 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:40,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:40,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:40,871 INFO L87 Difference]: Start difference. First operand 4005 states and 12730 transitions. Second operand 5 states. [2019-12-18 21:07:41,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:41,154 INFO L93 Difference]: Finished difference Result 4566 states and 14320 transitions. [2019-12-18 21:07:41,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 21:07:41,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 74 [2019-12-18 21:07:41,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:41,164 INFO L225 Difference]: With dead ends: 4566 [2019-12-18 21:07:41,164 INFO L226 Difference]: Without dead ends: 4566 [2019-12-18 21:07:41,164 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 21:07:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4566 states. [2019-12-18 21:07:41,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4566 to 4245. [2019-12-18 21:07:41,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4245 states. [2019-12-18 21:07:41,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4245 states to 4245 states and 13442 transitions. [2019-12-18 21:07:41,218 INFO L78 Accepts]: Start accepts. Automaton has 4245 states and 13442 transitions. Word has length 74 [2019-12-18 21:07:41,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:41,219 INFO L462 AbstractCegarLoop]: Abstraction has 4245 states and 13442 transitions. [2019-12-18 21:07:41,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:41,219 INFO L276 IsEmpty]: Start isEmpty. Operand 4245 states and 13442 transitions. [2019-12-18 21:07:41,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:07:41,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:41,226 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] [2019-12-18 21:07:41,226 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:41,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:41,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1990932941, now seen corresponding path program 3 times [2019-12-18 21:07:41,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:41,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88939140] [2019-12-18 21:07:41,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:41,339 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 21:07:41,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88939140] [2019-12-18 21:07:41,341 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:41,341 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 21:07:41,341 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294249776] [2019-12-18 21:07:41,342 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 21:07:41,342 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:41,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 21:07:41,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:41,343 INFO L87 Difference]: Start difference. First operand 4245 states and 13442 transitions. Second operand 6 states. [2019-12-18 21:07:41,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:41,963 INFO L93 Difference]: Finished difference Result 5359 states and 16722 transitions. [2019-12-18 21:07:41,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 21:07:41,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-12-18 21:07:41,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:41,974 INFO L225 Difference]: With dead ends: 5359 [2019-12-18 21:07:41,974 INFO L226 Difference]: Without dead ends: 5359 [2019-12-18 21:07:41,974 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 2 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 21:07:41,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5359 states. [2019-12-18 21:07:42,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5359 to 4609. [2019-12-18 21:07:42,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4609 states. [2019-12-18 21:07:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4609 states to 4609 states and 14566 transitions. [2019-12-18 21:07:42,043 INFO L78 Accepts]: Start accepts. Automaton has 4609 states and 14566 transitions. Word has length 74 [2019-12-18 21:07:42,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:42,043 INFO L462 AbstractCegarLoop]: Abstraction has 4609 states and 14566 transitions. [2019-12-18 21:07:42,043 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 21:07:42,044 INFO L276 IsEmpty]: Start isEmpty. Operand 4609 states and 14566 transitions. [2019-12-18 21:07:42,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-12-18 21:07:42,054 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:42,054 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] [2019-12-18 21:07:42,054 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:42,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:42,055 INFO L82 PathProgramCache]: Analyzing trace with hash -275771505, now seen corresponding path program 4 times [2019-12-18 21:07:42,055 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:42,055 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [625077666] [2019-12-18 21:07:42,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:42,151 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 21:07:42,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [625077666] [2019-12-18 21:07:42,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:42,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:42,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599425905] [2019-12-18 21:07:42,152 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:42,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:42,153 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:42,153 INFO L87 Difference]: Start difference. First operand 4609 states and 14566 transitions. Second operand 3 states. [2019-12-18 21:07:42,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:42,225 INFO L93 Difference]: Finished difference Result 4608 states and 14564 transitions. [2019-12-18 21:07:42,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:42,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-12-18 21:07:42,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:42,238 INFO L225 Difference]: With dead ends: 4608 [2019-12-18 21:07:42,238 INFO L226 Difference]: Without dead ends: 4608 [2019-12-18 21:07:42,239 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 21:07:42,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4608 states. [2019-12-18 21:07:42,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4608 to 3787. [2019-12-18 21:07:42,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3787 states. [2019-12-18 21:07:42,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3787 states to 3787 states and 12146 transitions. [2019-12-18 21:07:42,346 INFO L78 Accepts]: Start accepts. Automaton has 3787 states and 12146 transitions. Word has length 74 [2019-12-18 21:07:42,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:42,347 INFO L462 AbstractCegarLoop]: Abstraction has 3787 states and 12146 transitions. [2019-12-18 21:07:42,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:42,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3787 states and 12146 transitions. [2019-12-18 21:07:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-18 21:07:42,359 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:42,359 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] [2019-12-18 21:07:42,359 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:42,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:42,360 INFO L82 PathProgramCache]: Analyzing trace with hash 853231502, now seen corresponding path program 1 times [2019-12-18 21:07:42,360 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:42,361 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079782786] [2019-12-18 21:07:42,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:42,524 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 21:07:42,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079782786] [2019-12-18 21:07:42,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:42,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:42,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796843202] [2019-12-18 21:07:42,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:42,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:42,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:42,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:42,527 INFO L87 Difference]: Start difference. First operand 3787 states and 12146 transitions. Second operand 4 states. [2019-12-18 21:07:42,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:42,750 INFO L93 Difference]: Finished difference Result 6999 states and 22246 transitions. [2019-12-18 21:07:42,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:07:42,750 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-18 21:07:42,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:42,766 INFO L225 Difference]: With dead ends: 6999 [2019-12-18 21:07:42,766 INFO L226 Difference]: Without dead ends: 6999 [2019-12-18 21:07:42,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 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 21:07:42,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6999 states. [2019-12-18 21:07:42,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6999 to 4919. [2019-12-18 21:07:42,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4919 states. [2019-12-18 21:07:42,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 15934 transitions. [2019-12-18 21:07:42,882 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 15934 transitions. Word has length 75 [2019-12-18 21:07:42,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:42,882 INFO L462 AbstractCegarLoop]: Abstraction has 4919 states and 15934 transitions. [2019-12-18 21:07:42,882 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:42,882 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 15934 transitions. [2019-12-18 21:07:42,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-12-18 21:07:42,891 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:42,891 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] [2019-12-18 21:07:42,891 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:42,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:42,891 INFO L82 PathProgramCache]: Analyzing trace with hash -1306372238, now seen corresponding path program 2 times [2019-12-18 21:07:42,892 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:42,892 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958758055] [2019-12-18 21:07:42,892 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:42,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:42,989 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 21:07:42,989 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958758055] [2019-12-18 21:07:42,989 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:42,989 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:42,990 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054629080] [2019-12-18 21:07:42,990 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 21:07:42,990 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:42,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 21:07:42,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 21:07:42,991 INFO L87 Difference]: Start difference. First operand 4919 states and 15934 transitions. Second operand 4 states. [2019-12-18 21:07:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:43,140 INFO L93 Difference]: Finished difference Result 5055 states and 16106 transitions. [2019-12-18 21:07:43,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 21:07:43,141 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 75 [2019-12-18 21:07:43,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:43,149 INFO L225 Difference]: With dead ends: 5055 [2019-12-18 21:07:43,149 INFO L226 Difference]: Without dead ends: 5055 [2019-12-18 21:07:43,149 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 2 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 21:07:43,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5055 states. [2019-12-18 21:07:43,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5055 to 4971. [2019-12-18 21:07:43,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4971 states. [2019-12-18 21:07:43,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4971 states to 4971 states and 15866 transitions. [2019-12-18 21:07:43,218 INFO L78 Accepts]: Start accepts. Automaton has 4971 states and 15866 transitions. Word has length 75 [2019-12-18 21:07:43,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:43,218 INFO L462 AbstractCegarLoop]: Abstraction has 4971 states and 15866 transitions. [2019-12-18 21:07:43,218 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 21:07:43,218 INFO L276 IsEmpty]: Start isEmpty. Operand 4971 states and 15866 transitions. [2019-12-18 21:07:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-18 21:07:43,226 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:43,226 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] [2019-12-18 21:07:43,227 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:43,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash -609258745, now seen corresponding path program 1 times [2019-12-18 21:07:43,227 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:43,227 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306845205] [2019-12-18 21:07:43,227 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:43,477 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 21:07:43,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306845205] [2019-12-18 21:07:43,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:43,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:07:43,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114283663] [2019-12-18 21:07:43,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:07:43,479 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:43,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:07:43,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:07:43,481 INFO L87 Difference]: Start difference. First operand 4971 states and 15866 transitions. Second operand 10 states. [2019-12-18 21:07:44,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:44,316 INFO L93 Difference]: Finished difference Result 9787 states and 30894 transitions. [2019-12-18 21:07:44,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-18 21:07:44,317 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-12-18 21:07:44,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:44,332 INFO L225 Difference]: With dead ends: 9787 [2019-12-18 21:07:44,332 INFO L226 Difference]: Without dead ends: 9787 [2019-12-18 21:07:44,332 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-12-18 21:07:44,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9787 states. [2019-12-18 21:07:44,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9787 to 5903. [2019-12-18 21:07:44,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5903 states. [2019-12-18 21:07:44,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5903 states to 5903 states and 18926 transitions. [2019-12-18 21:07:44,429 INFO L78 Accepts]: Start accepts. Automaton has 5903 states and 18926 transitions. Word has length 76 [2019-12-18 21:07:44,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:44,429 INFO L462 AbstractCegarLoop]: Abstraction has 5903 states and 18926 transitions. [2019-12-18 21:07:44,429 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:07:44,429 INFO L276 IsEmpty]: Start isEmpty. Operand 5903 states and 18926 transitions. [2019-12-18 21:07:44,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-18 21:07:44,438 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:44,438 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] [2019-12-18 21:07:44,438 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:44,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:44,439 INFO L82 PathProgramCache]: Analyzing trace with hash 428533823, now seen corresponding path program 2 times [2019-12-18 21:07:44,439 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:44,439 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621337897] [2019-12-18 21:07:44,439 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:44,776 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 21:07:44,777 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621337897] [2019-12-18 21:07:44,777 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:44,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 21:07:44,777 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335693121] [2019-12-18 21:07:44,778 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 21:07:44,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:44,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 21:07:44,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-18 21:07:44,779 INFO L87 Difference]: Start difference. First operand 5903 states and 18926 transitions. Second operand 10 states. [2019-12-18 21:07:45,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:45,585 INFO L93 Difference]: Finished difference Result 9644 states and 30596 transitions. [2019-12-18 21:07:45,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-18 21:07:45,586 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2019-12-18 21:07:45,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:45,601 INFO L225 Difference]: With dead ends: 9644 [2019-12-18 21:07:45,602 INFO L226 Difference]: Without dead ends: 9644 [2019-12-18 21:07:45,607 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2019-12-18 21:07:45,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9644 states. [2019-12-18 21:07:45,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9644 to 5427. [2019-12-18 21:07:45,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5427 states. [2019-12-18 21:07:45,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5427 states to 5427 states and 17342 transitions. [2019-12-18 21:07:45,697 INFO L78 Accepts]: Start accepts. Automaton has 5427 states and 17342 transitions. Word has length 76 [2019-12-18 21:07:45,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:45,697 INFO L462 AbstractCegarLoop]: Abstraction has 5427 states and 17342 transitions. [2019-12-18 21:07:45,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 21:07:45,697 INFO L276 IsEmpty]: Start isEmpty. Operand 5427 states and 17342 transitions. [2019-12-18 21:07:45,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-12-18 21:07:45,706 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:45,706 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] [2019-12-18 21:07:45,706 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:45,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:45,707 INFO L82 PathProgramCache]: Analyzing trace with hash 168509030, now seen corresponding path program 1 times [2019-12-18 21:07:45,707 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:45,707 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209816851] [2019-12-18 21:07:45,707 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:45,785 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 21:07:45,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209816851] [2019-12-18 21:07:45,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:45,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 21:07:45,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606721143] [2019-12-18 21:07:45,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 21:07:45,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:45,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 21:07:45,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 21:07:45,787 INFO L87 Difference]: Start difference. First operand 5427 states and 17342 transitions. Second operand 3 states. [2019-12-18 21:07:45,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:45,818 INFO L93 Difference]: Finished difference Result 5067 states and 15934 transitions. [2019-12-18 21:07:45,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 21:07:45,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-12-18 21:07:45,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:45,827 INFO L225 Difference]: With dead ends: 5067 [2019-12-18 21:07:45,827 INFO L226 Difference]: Without dead ends: 5067 [2019-12-18 21:07:45,829 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 21:07:45,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5067 states. [2019-12-18 21:07:45,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5067 to 4915. [2019-12-18 21:07:45,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4915 states. [2019-12-18 21:07:45,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4915 states to 4915 states and 15478 transitions. [2019-12-18 21:07:45,931 INFO L78 Accepts]: Start accepts. Automaton has 4915 states and 15478 transitions. Word has length 76 [2019-12-18 21:07:45,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:45,931 INFO L462 AbstractCegarLoop]: Abstraction has 4915 states and 15478 transitions. [2019-12-18 21:07:45,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 21:07:45,931 INFO L276 IsEmpty]: Start isEmpty. Operand 4915 states and 15478 transitions. [2019-12-18 21:07:45,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 21:07:45,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:45,946 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] [2019-12-18 21:07:45,946 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:45,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:45,947 INFO L82 PathProgramCache]: Analyzing trace with hash 1704754565, now seen corresponding path program 1 times [2019-12-18 21:07:45,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:45,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487161641] [2019-12-18 21:07:45,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:46,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:46,115 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 21:07:46,115 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487161641] [2019-12-18 21:07:46,116 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:46,116 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:46,116 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504377078] [2019-12-18 21:07:46,116 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:46,117 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:46,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:46,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:46,117 INFO L87 Difference]: Start difference. First operand 4915 states and 15478 transitions. Second operand 5 states. [2019-12-18 21:07:46,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:46,175 INFO L93 Difference]: Finished difference Result 5289 states and 16336 transitions. [2019-12-18 21:07:46,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:46,176 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-18 21:07:46,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:46,183 INFO L225 Difference]: With dead ends: 5289 [2019-12-18 21:07:46,183 INFO L226 Difference]: Without dead ends: 2811 [2019-12-18 21:07:46,184 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-18 21:07:46,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2811 states. [2019-12-18 21:07:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2811 to 2811. [2019-12-18 21:07:46,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2811 states. [2019-12-18 21:07:46,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2811 states to 2811 states and 7683 transitions. [2019-12-18 21:07:46,242 INFO L78 Accepts]: Start accepts. Automaton has 2811 states and 7683 transitions. Word has length 77 [2019-12-18 21:07:46,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:46,243 INFO L462 AbstractCegarLoop]: Abstraction has 2811 states and 7683 transitions. [2019-12-18 21:07:46,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:46,243 INFO L276 IsEmpty]: Start isEmpty. Operand 2811 states and 7683 transitions. [2019-12-18 21:07:46,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 21:07:46,249 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:46,249 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] [2019-12-18 21:07:46,249 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:46,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:46,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1962287157, now seen corresponding path program 2 times [2019-12-18 21:07:46,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:46,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813384738] [2019-12-18 21:07:46,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:46,378 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 21:07:46,378 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813384738] [2019-12-18 21:07:46,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:46,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:46,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532461926] [2019-12-18 21:07:46,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:46,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:46,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:46,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:46,380 INFO L87 Difference]: Start difference. First operand 2811 states and 7683 transitions. Second operand 5 states. [2019-12-18 21:07:46,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:46,476 INFO L93 Difference]: Finished difference Result 4495 states and 11591 transitions. [2019-12-18 21:07:46,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:46,477 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-18 21:07:46,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:46,481 INFO L225 Difference]: With dead ends: 4495 [2019-12-18 21:07:46,481 INFO L226 Difference]: Without dead ends: 1884 [2019-12-18 21:07:46,482 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:46,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1884 states. [2019-12-18 21:07:46,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1884 to 1595. [2019-12-18 21:07:46,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1595 states. [2019-12-18 21:07:46,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1595 states to 1595 states and 3665 transitions. [2019-12-18 21:07:46,512 INFO L78 Accepts]: Start accepts. Automaton has 1595 states and 3665 transitions. Word has length 77 [2019-12-18 21:07:46,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:46,512 INFO L462 AbstractCegarLoop]: Abstraction has 1595 states and 3665 transitions. [2019-12-18 21:07:46,512 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:46,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1595 states and 3665 transitions. [2019-12-18 21:07:46,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 21:07:46,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:46,516 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] [2019-12-18 21:07:46,516 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:46,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:46,517 INFO L82 PathProgramCache]: Analyzing trace with hash 678929639, now seen corresponding path program 3 times [2019-12-18 21:07:46,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:46,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353444687] [2019-12-18 21:07:46,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:46,660 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 21:07:46,661 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353444687] [2019-12-18 21:07:46,667 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:46,667 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 21:07:46,668 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032119907] [2019-12-18 21:07:46,669 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 21:07:46,669 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:46,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 21:07:46,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-18 21:07:46,670 INFO L87 Difference]: Start difference. First operand 1595 states and 3665 transitions. Second operand 5 states. [2019-12-18 21:07:46,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:46,749 INFO L93 Difference]: Finished difference Result 2086 states and 4795 transitions. [2019-12-18 21:07:46,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 21:07:46,749 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 77 [2019-12-18 21:07:46,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:46,750 INFO L225 Difference]: With dead ends: 2086 [2019-12-18 21:07:46,750 INFO L226 Difference]: Without dead ends: 302 [2019-12-18 21:07:46,751 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-18 21:07:46,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2019-12-18 21:07:46,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 270. [2019-12-18 21:07:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2019-12-18 21:07:46,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 458 transitions. [2019-12-18 21:07:46,755 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 458 transitions. Word has length 77 [2019-12-18 21:07:46,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:46,755 INFO L462 AbstractCegarLoop]: Abstraction has 270 states and 458 transitions. [2019-12-18 21:07:46,755 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 21:07:46,755 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 458 transitions. [2019-12-18 21:07:46,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 21:07:46,756 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:46,756 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] [2019-12-18 21:07:46,756 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:46,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:46,757 INFO L82 PathProgramCache]: Analyzing trace with hash -15658207, now seen corresponding path program 4 times [2019-12-18 21:07:46,757 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:46,757 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432949170] [2019-12-18 21:07:46,757 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 21:07:47,106 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 21:07:47,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432949170] [2019-12-18 21:07:47,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 21:07:47,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 21:07:47,107 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86323176] [2019-12-18 21:07:47,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 21:07:47,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 21:07:47,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 21:07:47,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2019-12-18 21:07:47,109 INFO L87 Difference]: Start difference. First operand 270 states and 458 transitions. Second operand 14 states. [2019-12-18 21:07:47,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 21:07:47,565 INFO L93 Difference]: Finished difference Result 434 states and 732 transitions. [2019-12-18 21:07:47,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-18 21:07:47,566 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 77 [2019-12-18 21:07:47,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 21:07:47,566 INFO L225 Difference]: With dead ends: 434 [2019-12-18 21:07:47,567 INFO L226 Difference]: Without dead ends: 404 [2019-12-18 21:07:47,567 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=114, Invalid=486, Unknown=0, NotChecked=0, Total=600 [2019-12-18 21:07:47,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2019-12-18 21:07:47,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 378. [2019-12-18 21:07:47,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2019-12-18 21:07:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 643 transitions. [2019-12-18 21:07:47,572 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 643 transitions. Word has length 77 [2019-12-18 21:07:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 21:07:47,573 INFO L462 AbstractCegarLoop]: Abstraction has 378 states and 643 transitions. [2019-12-18 21:07:47,573 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 21:07:47,573 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 643 transitions. [2019-12-18 21:07:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2019-12-18 21:07:47,574 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 21:07:47,574 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] [2019-12-18 21:07:47,574 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 21:07:47,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 21:07:47,574 INFO L82 PathProgramCache]: Analyzing trace with hash -432368573, now seen corresponding path program 5 times [2019-12-18 21:07:47,574 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 21:07:47,575 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671967206] [2019-12-18 21:07:47,575 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 21:07:47,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:07:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 21:07:47,728 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 21:07:47,728 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 21:07:47,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1068] [1068] ULTIMATE.startENTRY-->L839: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= (store |v_#length_30| |v_ULTIMATE.start_main_~#t829~0.base_24| 4) |v_#length_29|) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff1_thd2~0_8 0) (= v_~z~0_36 0) (= 0 v_~weak$$choice0~0_9) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24| 1)) (= v_~z$mem_tmp~0_11 0) (= |v_#NULL.offset_6| 0) (= v_~z$r_buff1_thd1~0_8 0) (= 0 v_~__unbuffered_p3_EAX~0_11) (= 0 v_~z$r_buff1_thd3~0_19) (= 0 v_~z$r_buff1_thd4~0_40) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t829~0.base_24|) (= 0 v_~z$w_buff1_used~0_77) (= 0 |v_ULTIMATE.start_main_~#t829~0.offset_19|) (= v_~z$r_buff0_thd2~0_8 0) (= 0 v_~z$w_buff1~0_35) (= v_~z$read_delayed~0_6 0) (= 0 v_~z$w_buff0~0_37) (= v_~z$r_buff0_thd4~0_75 0) (= 0 v_~z$flush_delayed~0_19) (= v_~z$read_delayed_var~0.offset_7 0) (= v_~z$r_buff0_thd3~0_19 0) (= v_~a~0_10 0) (= 0 |v_#NULL.base_6|) (= 0 v_~weak$$choice2~0_33) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$w_buff0_used~0_143 0) (= v_~z$r_buff0_thd1~0_9 0) (= 0 v_~__unbuffered_cnt~0_24) (= v_~z$r_buff0_thd0~0_67 0) (< 0 |v_#StackHeapBarrier_20|) (= (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t829~0.base_24|) |v_ULTIMATE.start_main_~#t829~0.offset_19| 0)) |v_#memory_int_27|) (= 0 v_~z$r_buff1_thd0~0_36) (= v_~x~0_12 0) (= v_~y~0_11 0) (= v_~main$tmp_guard1~0_13 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t829~0.base_24|)) (= 0 v_~__unbuffered_p3_EBX~0_10))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_30|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_8, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_10|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_14|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite68=|v_ULTIMATE.start_main_#t~ite68_14|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_12|, ULTIMATE.start_main_#t~ite66=|v_ULTIMATE.start_main_#t~ite66_12|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ULTIMATE.start_main_#t~ite64=|v_ULTIMATE.start_main_#t~ite64_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_12|, ~a~0=v_~a~0_10, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_67, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_75, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_11, #length=|v_#length_29|, ULTIMATE.start_main_#t~nondet48=|v_ULTIMATE.start_main_#t~nondet48_8|, ~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_8|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_18|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_23|, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_12|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_77, ~z$flush_delayed~0=v_~z$flush_delayed~0_19, ULTIMATE.start_main_#t~ite54=|v_ULTIMATE.start_main_#t~ite54_13|, ULTIMATE.start_main_#t~ite56=|v_ULTIMATE.start_main_#t~ite56_14|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_23|, ULTIMATE.start_main_#t~ite63=|v_ULTIMATE.start_main_#t~ite63_12|, ~weak$$choice0~0=v_~weak$$choice0~0_9, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_13|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_8, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_19, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~x~0=v_~x~0_12, ULTIMATE.start_main_~#t829~0.base=|v_ULTIMATE.start_main_~#t829~0.base_24|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_40, ~z$read_delayed~0=v_~z$read_delayed~0_6, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~z$w_buff1~0=v_~z$w_buff1~0_35, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ULTIMATE.start_main_#t~ite69=|v_ULTIMATE.start_main_#t~ite69_12|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_12|, ULTIMATE.start_main_#t~ite67=|v_ULTIMATE.start_main_#t~ite67_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_#t~ite65=|v_ULTIMATE.start_main_#t~ite65_14|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_12|, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_18|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_36, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_18|, ULTIMATE.start_main_~#t829~0.offset=|v_ULTIMATE.start_main_~#t829~0.offset_19|, ULTIMATE.start_main_#t~nondet49=|v_ULTIMATE.start_main_#t~nondet49_8|, ~y~0=v_~y~0_11, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_8, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_8|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_143, ~z$w_buff0~0=v_~z$w_buff0~0_37, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_19, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_13|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_10, ULTIMATE.start_main_#t~ite53=|v_ULTIMATE.start_main_#t~ite53_15|, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#t~ite55=|v_ULTIMATE.start_main_#t~ite55_13|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_14|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_13|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_36, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_9} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_~#t832~0.offset, #NULL.offset, ULTIMATE.start_main_#t~ite68, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite66, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite64, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ULTIMATE.start_main_#t~nondet48, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, ULTIMATE.start_main_#t~ite58, ~z$w_buff1_used~0, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite54, ULTIMATE.start_main_#t~ite56, ULTIMATE.start_main_~#t831~0.base, ULTIMATE.start_main_#t~ite63, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite61, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet38, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t829~0.base, ULTIMATE.start_main_~#t832~0.base, ~z$r_buff1_thd4~0, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite69, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite67, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite65, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_#t~ite70, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t831~0.offset, ULTIMATE.start_main_~#t829~0.offset, ULTIMATE.start_main_#t~nondet49, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet40, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite53, #NULL.base, ULTIMATE.start_main_#t~ite55, ULTIMATE.start_main_#t~ite62, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 21:07:47,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1032] [1032] L839-1-->L841: Formula: (and (= |v_ULTIMATE.start_main_~#t830~0.offset_9| 0) (= |v_#valid_41| (store |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10| 1)) (= (select |v_#valid_42| |v_ULTIMATE.start_main_~#t830~0.base_10|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t830~0.base_10|)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t830~0.base_10|) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t830~0.base_10| 4) |v_#length_17|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t830~0.base_10|) |v_ULTIMATE.start_main_~#t830~0.offset_9| 1)) |v_#memory_int_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t830~0.offset=|v_ULTIMATE.start_main_~#t830~0.offset_9|, ULTIMATE.start_main_~#t830~0.base=|v_ULTIMATE.start_main_~#t830~0.base_10|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t830~0.offset, ULTIMATE.start_main_~#t830~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-18 21:07:47,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1038] [1038] L841-1-->L843: Formula: (and (= |v_ULTIMATE.start_main_~#t831~0.offset_10| 0) (= (store |v_#length_20| |v_ULTIMATE.start_main_~#t831~0.base_12| 4) |v_#length_19|) (= 0 (select |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12|)) (= (store |v_#valid_47| |v_ULTIMATE.start_main_~#t831~0.base_12| 1) |v_#valid_46|) (not (= |v_ULTIMATE.start_main_~#t831~0.base_12| 0)) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t831~0.base_12|) |v_ULTIMATE.start_main_~#t831~0.offset_10| 2)) |v_#memory_int_17|) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t831~0.base_12|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_18|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_13|, ULTIMATE.start_main_~#t831~0.offset=|v_ULTIMATE.start_main_~#t831~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_17|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|, ULTIMATE.start_main_~#t831~0.base=|v_ULTIMATE.start_main_~#t831~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t831~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t831~0.base] because there is no mapped edge [2019-12-18 21:07:47,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1050] [1050] L843-1-->L845: Formula: (and (< |v_#StackHeapBarrier_15| |v_ULTIMATE.start_main_~#t832~0.base_13|) (= (store |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13| 1) |v_#valid_52|) (= |v_ULTIMATE.start_main_~#t832~0.offset_11| 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t832~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t832~0.base_13| 0)) (= 0 (select |v_#valid_53| |v_ULTIMATE.start_main_~#t832~0.base_13|)) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t832~0.base_13|) |v_ULTIMATE.start_main_~#t832~0.offset_11| 3)) |v_#memory_int_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_15|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_15|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_5|, ULTIMATE.start_main_~#t832~0.base=|v_ULTIMATE.start_main_~#t832~0.base_13|, #valid=|v_#valid_52|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_~#t832~0.offset=|v_ULTIMATE.start_main_~#t832~0.offset_11|, #length=|v_#length_23|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t832~0.base, #valid, #memory_int, ULTIMATE.start_main_~#t832~0.offset, #length] because there is no mapped edge [2019-12-18 21:07:47,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [959] [959] P3ENTRY-->L4-3: Formula: (and (= v_P3Thread1of1ForFork3_~arg.base_4 |v_P3Thread1of1ForFork3_#in~arg.base_4|) (= v_~z$w_buff0_used~0_116 1) (= 2 v_~z$w_buff0~0_24) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_4| 1) (= v_P3Thread1of1ForFork3_~arg.offset_4 |v_P3Thread1of1ForFork3_#in~arg.offset_4|) (= |v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_4| v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_6) (= v_~z$w_buff0_used~0_117 v_~z$w_buff1_used~0_65) (= 0 (mod v_~z$w_buff1_used~0_65 256)) (= v_~z$w_buff0~0_25 v_~z$w_buff1~0_22)) InVars {~z$w_buff0_used~0=v_~z$w_buff0_used~0_117, ~z$w_buff0~0=v_~z$w_buff0~0_25, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_4|, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_4|} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=v_P3Thread1of1ForFork3___VERIFIER_assert_~expression_6, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_116, ~z$w_buff0~0=v_~z$w_buff0~0_24, P3Thread1of1ForFork3_~arg.offset=v_P3Thread1of1ForFork3_~arg.offset_4, P3Thread1of1ForFork3_#in~arg.offset=|v_P3Thread1of1ForFork3_#in~arg.offset_4|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_65, ~z$w_buff1~0=v_~z$w_buff1~0_22, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression=|v_P3Thread1of1ForFork3___VERIFIER_assert_#in~expression_4|, P3Thread1of1ForFork3_~arg.base=v_P3Thread1of1ForFork3_~arg.base_4, P3Thread1of1ForFork3_#in~arg.base=|v_P3Thread1of1ForFork3_#in~arg.base_4|} AuxVars[] AssignedVars[P3Thread1of1ForFork3___VERIFIER_assert_~expression, ~z$w_buff0_used~0, ~z$w_buff0~0, P3Thread1of1ForFork3_~arg.offset, ~z$w_buff1_used~0, ~z$w_buff1~0, P3Thread1of1ForFork3___VERIFIER_assert_#in~expression, P3Thread1of1ForFork3_~arg.base] because there is no mapped edge [2019-12-18 21:07:47,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1013] [1013] L801-2-->L801-5: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd4~0_In910019596 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In910019596 256) 0)) (.cse2 (= |P3Thread1of1ForFork3_#t~ite12_Out910019596| |P3Thread1of1ForFork3_#t~ite11_Out910019596|))) (or (and (not .cse0) (= ~z$w_buff0~0_In910019596 |P3Thread1of1ForFork3_#t~ite11_Out910019596|) (not .cse1) .cse2) (and (= ~z$w_buff1~0_In910019596 |P3Thread1of1ForFork3_#t~ite11_Out910019596|) (or .cse0 .cse1) .cse2))) InVars {~z$w_buff0~0=~z$w_buff0~0_In910019596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In910019596, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In910019596, ~z$w_buff1~0=~z$w_buff1~0_In910019596} OutVars{~z$w_buff0~0=~z$w_buff0~0_In910019596, ~z$w_buff0_used~0=~z$w_buff0_used~0_In910019596, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out910019596|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In910019596, ~z$w_buff1~0=~z$w_buff1~0_In910019596, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out910019596|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12, P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-18 21:07:47,749 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [943] [943] L806-->L807: Formula: (and (= v_~z$r_buff0_thd4~0_52 v_~z$r_buff0_thd4~0_51) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P3Thread1of1ForFork3_#t~ite27=|v_P3Thread1of1ForFork3_#t~ite27_7|, P3Thread1of1ForFork3_#t~ite26=|v_P3Thread1of1ForFork3_#t~ite26_7|, P3Thread1of1ForFork3_#t~ite25=|v_P3Thread1of1ForFork3_#t~ite25_7|, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_51, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite27, P3Thread1of1ForFork3_#t~ite26, P3Thread1of1ForFork3_#t~ite25, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 21:07:47,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [993] [993] L809-->L809-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In1184071590 256)))) (or (and .cse0 (= |P3Thread1of1ForFork3_#t~ite31_Out1184071590| ~z~0_In1184071590)) (and (= |P3Thread1of1ForFork3_#t~ite31_Out1184071590| ~z$mem_tmp~0_In1184071590) (not .cse0)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In1184071590, ~z$flush_delayed~0=~z$flush_delayed~0_In1184071590, ~z~0=~z~0_In1184071590} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In1184071590, ~z$flush_delayed~0=~z$flush_delayed~0_In1184071590, ~z~0=~z~0_In1184071590, P3Thread1of1ForFork3_#t~ite31=|P3Thread1of1ForFork3_#t~ite31_Out1184071590|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-18 21:07:47,752 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1040] [1040] P0ENTRY-->P0EXIT: Formula: (and (= 1 v_~a~0_5) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_4 |v_P0Thread1of1ForFork0_#in~arg.offset_4|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= 1 v_~x~0_8) (= v_P0Thread1of1ForFork0_~arg.base_4 |v_P0Thread1of1ForFork0_#in~arg.base_4|)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{~a~0=v_~a~0_5, P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_4|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_4|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_4, ~x~0=v_~x~0_8, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_4} AuxVars[] AssignedVars[~a~0, P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, ~x~0, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 21:07:47,753 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1049] [1049] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= 2 v_~x~0_9) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= 1 v_~y~0_8) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_20 (+ v_~__unbuffered_cnt~0_21 1))) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~y~0=v_~y~0_8, ~x~0=v_~x~0_9, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~y~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 21:07:47,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1000] [1000] L770-2-->L770-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-892515383 256))) (.cse2 (= |P2Thread1of1ForFork2_#t~ite3_Out-892515383| |P2Thread1of1ForFork2_#t~ite4_Out-892515383|)) (.cse1 (= (mod ~z$w_buff1_used~0_In-892515383 256) 0))) (or (and (= ~z~0_In-892515383 |P2Thread1of1ForFork2_#t~ite3_Out-892515383|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In-892515383 |P2Thread1of1ForFork2_#t~ite3_Out-892515383|) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-892515383, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-892515383, ~z$w_buff1~0=~z$w_buff1~0_In-892515383, ~z~0=~z~0_In-892515383} OutVars{P2Thread1of1ForFork2_#t~ite4=|P2Thread1of1ForFork2_#t~ite4_Out-892515383|, P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out-892515383|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-892515383, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-892515383, ~z$w_buff1~0=~z$w_buff1~0_In-892515383, ~z~0=~z~0_In-892515383} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-18 21:07:47,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [989] [989] L771-->L771-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-564812588 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd3~0_In-564812588 256) 0))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-564812588|) (not .cse0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-564812588 |P2Thread1of1ForFork2_#t~ite5_Out-564812588|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-564812588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-564812588} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-564812588|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-564812588, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-564812588} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-18 21:07:47,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L772-->L772-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1095707365 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1095707365 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In-1095707365 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In-1095707365 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite6_Out-1095707365|)) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~z$w_buff1_used~0_In-1095707365 |P2Thread1of1ForFork2_#t~ite6_Out-1095707365|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095707365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1095707365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1095707365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1095707365} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-1095707365|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1095707365, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1095707365, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1095707365, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1095707365} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-18 21:07:47,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1008] [1008] L773-->L773-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In1743039243 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In1743039243 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out1743039243| ~z$r_buff0_thd3~0_In1743039243)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out1743039243| 0) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1743039243, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1743039243} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1743039243, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1743039243, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out1743039243|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-18 21:07:47,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1001] [1001] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In694491823 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In694491823 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In694491823 256))) (.cse2 (= (mod ~z$r_buff1_thd3~0_In694491823 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite8_Out694491823| 0)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite8_Out694491823| ~z$r_buff1_thd3~0_In694491823) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In694491823, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In694491823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In694491823, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In694491823} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In694491823, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In694491823, ~z$w_buff1_used~0=~z$w_buff1_used~0_In694491823, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In694491823, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out694491823|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:07:47,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1045] [1045] L774-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= v_~z$r_buff1_thd3~0_15 |v_P2Thread1of1ForFork2_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_8|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_15, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_7|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-18 21:07:47,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1005] [1005] L817-->L817-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1779014298 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-1779014298 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-1779014298 |P3Thread1of1ForFork3_#t~ite34_Out-1779014298|)) (and (not .cse0) (not .cse1) (= 0 |P3Thread1of1ForFork3_#t~ite34_Out-1779014298|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1779014298, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1779014298} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1779014298, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-1779014298, P3Thread1of1ForFork3_#t~ite34=|P3Thread1of1ForFork3_#t~ite34_Out-1779014298|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite34] because there is no mapped edge [2019-12-18 21:07:47,763 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [999] [999] L818-->L818-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In1710815103 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1710815103 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1710815103 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd4~0_In1710815103 256) 0))) (or (and (= ~z$w_buff1_used~0_In1710815103 |P3Thread1of1ForFork3_#t~ite35_Out1710815103|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P3Thread1of1ForFork3_#t~ite35_Out1710815103| 0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1710815103, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1710815103, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1710815103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1710815103} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1710815103, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1710815103, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1710815103, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1710815103, P3Thread1of1ForFork3_#t~ite35=|P3Thread1of1ForFork3_#t~ite35_Out1710815103|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite35] because there is no mapped edge [2019-12-18 21:07:47,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1004] [1004] L819-->L820: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In-966350868 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-966350868 256) 0))) (or (and (= ~z$r_buff0_thd4~0_Out-966350868 ~z$r_buff0_thd4~0_In-966350868) (or .cse0 .cse1)) (and (= 0 ~z$r_buff0_thd4~0_Out-966350868) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-966350868, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-966350868} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-966350868, P3Thread1of1ForFork3_#t~ite36=|P3Thread1of1ForFork3_#t~ite36_Out-966350868|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out-966350868} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite36, ~z$r_buff0_thd4~0] because there is no mapped edge [2019-12-18 21:07:47,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [997] [997] L820-->L820-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In1482448043 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd4~0_In1482448043 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1482448043 256))) (.cse3 (= (mod ~z$r_buff0_thd4~0_In1482448043 256) 0))) (or (and (= 0 |P3Thread1of1ForFork3_#t~ite37_Out1482448043|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P3Thread1of1ForFork3_#t~ite37_Out1482448043| ~z$r_buff1_thd4~0_In1482448043) (or .cse1 .cse0) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1482448043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1482448043, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1482448043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1482448043} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In1482448043, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1482448043, P3Thread1of1ForFork3_#t~ite37=|P3Thread1of1ForFork3_#t~ite37_Out1482448043|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1482448043, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1482448043} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite37] because there is no mapped edge [2019-12-18 21:07:47,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1047] [1047] L820-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork3_#t~ite37_8| v_~z$r_buff1_thd4~0_36) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_18 (+ v_~__unbuffered_cnt~0_19 1))) InVars {P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_36, P3Thread1of1ForFork3_#t~ite37=|v_P3Thread1of1ForFork3_#t~ite37_7|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite37, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-18 21:07:47,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L845-1-->L851: Formula: (and (= 4 v_~__unbuffered_cnt~0_11) (= v_~main$tmp_guard0~0_4 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 21:07:47,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [991] [991] L851-2-->L851-4: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-50031028 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In-50031028 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-50031028 |ULTIMATE.start_main_#t~ite42_Out-50031028|)) (and (= ~z~0_In-50031028 |ULTIMATE.start_main_#t~ite42_Out-50031028|) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-50031028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-50031028, ~z$w_buff1~0=~z$w_buff1~0_In-50031028, ~z~0=~z~0_In-50031028} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-50031028, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-50031028, ~z$w_buff1~0=~z$w_buff1~0_In-50031028, ~z~0=~z~0_In-50031028, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-50031028|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:07:47,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [971] [971] L851-4-->L852: Formula: (= v_~z~0_25 |v_ULTIMATE.start_main_#t~ite42_8|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} OutVars{~z~0=v_~z~0_25, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_7|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_7|} AuxVars[] AssignedVars[~z~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-18 21:07:47,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1003] [1003] L852-->L852-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-667785559 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-667785559 256)))) (or (and (= |ULTIMATE.start_main_#t~ite44_Out-667785559| ~z$w_buff0_used~0_In-667785559) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out-667785559| 0) (not .cse0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-667785559, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-667785559} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-667785559, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-667785559, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-667785559|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-18 21:07:47,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1006] [1006] L853-->L853-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In2131977248 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In2131977248 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In2131977248 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In2131977248 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite45_Out2131977248|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~z$w_buff1_used~0_In2131977248 |ULTIMATE.start_main_#t~ite45_Out2131977248|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2131977248, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131977248, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2131977248, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2131977248} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2131977248, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2131977248, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2131977248, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2131977248, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2131977248|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-18 21:07:47,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [994] [994] L854-->L854-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In944857010 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In944857010 256)))) (or (and (= ~z$r_buff0_thd0~0_In944857010 |ULTIMATE.start_main_#t~ite46_Out944857010|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite46_Out944857010|) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In944857010, ~z$w_buff0_used~0=~z$w_buff0_used~0_In944857010} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In944857010, ~z$w_buff0_used~0=~z$w_buff0_used~0_In944857010, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out944857010|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-18 21:07:47,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1014] [1014] L855-->L855-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1164136445 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1164136445 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In-1164136445 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In-1164136445 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite47_Out-1164136445| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite47_Out-1164136445| ~z$r_buff1_thd0~0_In-1164136445) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1164136445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164136445, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1164136445, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164136445} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1164136445, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1164136445, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1164136445, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1164136445|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1164136445} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-18 21:07:47,777 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1009] [1009] L870-->L870-2: Formula: (let ((.cse0 (= 0 (mod ~z$flush_delayed~0_In-1041869536 256)))) (or (and (= ~z~0_In-1041869536 |ULTIMATE.start_main_#t~ite70_Out-1041869536|) .cse0) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite70_Out-1041869536| ~z$mem_tmp~0_In-1041869536)))) InVars {~z$mem_tmp~0=~z$mem_tmp~0_In-1041869536, ~z$flush_delayed~0=~z$flush_delayed~0_In-1041869536, ~z~0=~z~0_In-1041869536} OutVars{~z$mem_tmp~0=~z$mem_tmp~0_In-1041869536, ULTIMATE.start_main_#t~ite70=|ULTIMATE.start_main_#t~ite70_Out-1041869536|, ~z$flush_delayed~0=~z$flush_delayed~0_In-1041869536, ~z~0=~z~0_In-1041869536} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite70] because there is no mapped edge [2019-12-18 21:07:47,778 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [1061] [1061] L870-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|) (= v_~z~0_32 |v_ULTIMATE.start_main_#t~ite70_12|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6| (mod v_~main$tmp_guard1~0_8 256)) (= 0 v_~z$flush_delayed~0_15)) InVars {ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_12|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite70=|v_ULTIMATE.start_main_#t~ite70_11|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_8, ~z$flush_delayed~0=v_~z$flush_delayed~0_15, ~z~0=v_~z~0_32, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite70, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 21:07:47,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 09:07:47 BasicIcfg [2019-12-18 21:07:47,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 21:07:47,920 INFO L168 Benchmark]: Toolchain (without parser) took 73027.90 ms. Allocated memory was 145.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 101.7 MB in the beginning and 776.0 MB in the end (delta: -674.3 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,920 INFO L168 Benchmark]: CDTParser took 0.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 771.71 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 153.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 88.56 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 149.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,923 INFO L168 Benchmark]: Boogie Preprocessor took 47.32 ms. Allocated memory is still 203.4 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,927 INFO L168 Benchmark]: RCFGBuilder took 1022.37 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 147.1 MB in the beginning and 202.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,928 INFO L168 Benchmark]: TraceAbstraction took 71093.09 ms. Allocated memory was 237.0 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 202.5 MB in the beginning and 776.0 MB in the end (delta: -573.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. [2019-12-18 21:07:47,936 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.50 ms. Allocated memory is still 145.8 MB. Free memory was 122.1 MB in the beginning and 121.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 771.71 ms. Allocated memory was 145.8 MB in the beginning and 203.4 MB in the end (delta: 57.7 MB). Free memory was 101.3 MB in the beginning and 153.1 MB in the end (delta: -51.8 MB). Peak memory consumption was 21.0 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 88.56 ms. Allocated memory is still 203.4 MB. Free memory was 153.1 MB in the beginning and 149.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.32 ms. Allocated memory is still 203.4 MB. Free memory was 149.8 MB in the beginning and 147.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1022.37 ms. Allocated memory was 203.4 MB in the beginning and 237.0 MB in the end (delta: 33.6 MB). Free memory was 147.1 MB in the beginning and 202.5 MB in the end (delta: -55.4 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 71093.09 ms. Allocated memory was 237.0 MB in the beginning and 3.0 GB in the end (delta: 2.7 GB). Free memory was 202.5 MB in the beginning and 776.0 MB in the end (delta: -573.5 MB). Peak memory consumption was 2.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.4s, 221 ProgramPointsBefore, 126 ProgramPointsAfterwards, 270 TransitionsBefore, 148 TransitionsAfterwards, 28796 CoEnabledTransitionPairs, 7 FixpointIterations, 35 TrivialSequentialCompositions, 42 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 51 ConcurrentYvCompositions, 32 ChoiceCompositions, 10136 VarBasedMoverChecksPositive, 280 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 156307 CheckedPairsTotal, 128 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L839] FCALL, FORK 0 pthread_create(&t829, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t830, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L843] FCALL, FORK 0 pthread_create(&t831, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L845] FCALL, FORK 0 pthread_create(&t832, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L790] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L791] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L792] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L793] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L794] 4 z$r_buff0_thd4 = (_Bool)1 [L797] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L798] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L799] 4 z$flush_delayed = weak$$choice2 [L800] 4 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] EXPR 4 !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L801] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L802] EXPR 4 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L802] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L803] EXPR 4 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L803] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L804] EXPR 4 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L804] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L805] EXPR 4 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L805] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L807] EXPR 4 weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L808] 4 __unbuffered_p3_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=2, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L809] 4 z = z$flush_delayed ? z$mem_tmp : z [L810] 4 z$flush_delayed = (_Bool)0 [L813] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L764] 3 y = 2 [L767] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L816] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L770] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L771] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L772] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L773] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L817] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L818] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L851] 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L852] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L853] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L854] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L855] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L858] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L859] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L860] 0 z$flush_delayed = weak$$choice2 [L861] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L862] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L863] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L863] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L864] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L865] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L865] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L866] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L866] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L867] EXPR 0 weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L867] 0 z$r_buff0_thd0 = weak$$choice2 ? z$r_buff0_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff0_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0)) [L868] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L868] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L869] 0 main$tmp_guard1 = !(x == 2 && y == 2 && z == 2 && __unbuffered_p3_EAX == 2 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p3_EAX=2, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=2, y=2, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 209 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.7s, OverallIterations: 20, TraceHistogramMax: 1, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3501 SDtfs, 3430 SDslu, 7925 SDs, 0 SdLazy, 3707 SolverSat, 208 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 154 GetRequests, 41 SyntacticMatches, 15 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=174914occurred 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: 24.6s AutomataMinimizationTime, 19 MinimizatonAttempts, 19837 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 1160 NumberOfCodeBlocks, 1160 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1064 ConstructedInterpolants, 0 QuantifiedInterpolants, 243740 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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...