/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/rfi008_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 07:13:31,465 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 07:13:31,467 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 07:13:31,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 07:13:31,481 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 07:13:31,484 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 07:13:31,486 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 07:13:31,498 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 07:13:31,500 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 07:13:31,501 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 07:13:31,502 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 07:13:31,503 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 07:13:31,503 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 07:13:31,504 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 07:13:31,505 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 07:13:31,507 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 07:13:31,507 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 07:13:31,508 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 07:13:31,510 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 07:13:31,512 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 07:13:31,513 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 07:13:31,514 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 07:13:31,515 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 07:13:31,516 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 07:13:31,518 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 07:13:31,518 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 07:13:31,519 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 07:13:31,519 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 07:13:31,520 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 07:13:31,521 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 07:13:31,521 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 07:13:31,522 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 07:13:31,523 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 07:13:31,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 07:13:31,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 07:13:31,525 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 07:13:31,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 07:13:31,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 07:13:31,526 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 07:13:31,526 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 07:13:31,528 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 07:13:31,529 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-27 07:13:31,550 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 07:13:31,550 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 07:13:31,553 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 07:13:31,553 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 07:13:31,553 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 07:13:31,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 07:13:31,554 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 07:13:31,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 07:13:31,554 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 07:13:31,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 07:13:31,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 07:13:31,556 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 07:13:31,556 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 07:13:31,556 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 07:13:31,556 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 07:13:31,557 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 07:13:31,557 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 07:13:31,557 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 07:13:31,557 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 07:13:31,557 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 07:13:31,558 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 07:13:31,558 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 07:13:31,558 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 07:13:31,559 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 07:13:31,559 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 07:13:31,559 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 07:13:31,559 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 07:13:31,559 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 07:13:31,559 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 07:13:31,560 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 07:13:31,849 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 07:13:31,867 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 07:13:31,871 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 07:13:31,872 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 07:13:31,873 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 07:13:31,874 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/rfi008_pso.opt.i [2019-12-27 07:13:31,949 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f207e03/365649349ad342aca2e73a730fe9bcc6/FLAGd7a9326f0 [2019-12-27 07:13:32,471 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 07:13:32,472 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/rfi008_pso.opt.i [2019-12-27 07:13:32,496 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f207e03/365649349ad342aca2e73a730fe9bcc6/FLAGd7a9326f0 [2019-12-27 07:13:32,753 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5f207e03/365649349ad342aca2e73a730fe9bcc6 [2019-12-27 07:13:32,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 07:13:32,766 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 07:13:32,767 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 07:13:32,767 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 07:13:32,770 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 07:13:32,771 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:13:32" (1/1) ... [2019-12-27 07:13:32,774 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e5e2723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:32, skipping insertion in model container [2019-12-27 07:13:32,774 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 07:13:32" (1/1) ... [2019-12-27 07:13:32,782 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 07:13:32,838 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 07:13:33,414 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:13:33,428 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 07:13:33,514 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 07:13:33,587 INFO L208 MainTranslator]: Completed translation [2019-12-27 07:13:33,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33 WrapperNode [2019-12-27 07:13:33,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 07:13:33,589 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 07:13:33,589 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 07:13:33,589 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 07:13:33,598 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,619 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,657 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 07:13:33,658 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 07:13:33,658 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 07:13:33,658 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 07:13:33,669 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,670 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,676 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,676 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (1/1) ... [2019-12-27 07:13:33,701 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 07:13:33,702 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 07:13:33,702 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 07:13:33,702 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 07:13:33,703 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (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-27 07:13:33,772 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 07:13:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 07:13:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 07:13:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 07:13:33,773 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 07:13:33,773 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 07:13:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 07:13:33,774 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 07:13:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 07:13:33,774 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 07:13:33,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 07:13:33,777 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 07:13:34,530 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 07:13:34,531 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 07:13:34,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:13:34 BoogieIcfgContainer [2019-12-27 07:13:34,533 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 07:13:34,535 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 07:13:34,535 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 07:13:34,540 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 07:13:34,541 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 07:13:32" (1/3) ... [2019-12-27 07:13:34,542 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c382122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:13:34, skipping insertion in model container [2019-12-27 07:13:34,542 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 07:13:33" (2/3) ... [2019-12-27 07:13:34,543 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c382122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 07:13:34, skipping insertion in model container [2019-12-27 07:13:34,544 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 07:13:34" (3/3) ... [2019-12-27 07:13:34,546 INFO L109 eAbstractionObserver]: Analyzing ICFG rfi008_pso.opt.i [2019-12-27 07:13:34,557 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 07:13:34,558 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 07:13:34,570 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 07:13:34,571 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 07:13:34,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,662 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,663 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,666 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,667 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,668 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,669 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,670 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,671 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,672 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,673 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,674 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,675 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,676 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,677 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,678 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,680 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,681 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,682 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,683 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,696 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,697 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,702 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,704 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,705 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,712 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,713 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,714 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,715 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,716 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,717 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,736 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,737 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,742 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,743 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,743 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,744 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,745 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,745 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,746 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,751 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,752 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite49| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,764 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,765 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite54| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,766 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,767 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,767 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite53| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~nondet27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite52| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite51| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,768 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite50| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,769 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 07:13:34,784 INFO L249 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2019-12-27 07:13:34,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 07:13:34,802 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 07:13:34,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 07:13:34,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 07:13:34,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 07:13:34,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 07:13:34,802 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 07:13:34,802 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 07:13:34,815 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 179 places, 228 transitions [2019-12-27 07:13:34,817 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 07:13:34,932 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 07:13:34,932 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:13:34,950 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 07:13:34,977 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 179 places, 228 transitions [2019-12-27 07:13:35,037 INFO L132 PetriNetUnfolder]: 56/226 cut-off events. [2019-12-27 07:13:35,038 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 07:13:35,047 INFO L76 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 226 events. 56/226 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 551 event pairs. 0/168 useless extension candidates. Maximal degree in co-relation 195. Up to 2 conditions per place. [2019-12-27 07:13:35,076 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 22816 [2019-12-27 07:13:35,077 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 07:13:38,058 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:13:38,160 WARN L192 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 79 [2019-12-27 07:13:38,447 WARN L192 SmtUtils]: Spent 259.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 07:13:38,573 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 07:13:38,615 INFO L206 etLargeBlockEncoding]: Checked pairs total: 149863 [2019-12-27 07:13:38,616 INFO L214 etLargeBlockEncoding]: Total number of compositions: 109 [2019-12-27 07:13:38,619 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 108 places, 133 transitions [2019-12-27 07:13:40,321 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 27271 states. [2019-12-27 07:13:40,323 INFO L276 IsEmpty]: Start isEmpty. Operand 27271 states. [2019-12-27 07:13:40,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 07:13:40,329 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:40,329 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 07:13:40,330 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:40,335 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:40,335 INFO L82 PathProgramCache]: Analyzing trace with hash 955890454, now seen corresponding path program 1 times [2019-12-27 07:13:40,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:40,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548801845] [2019-12-27 07:13:40,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:40,585 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-27 07:13:40,585 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548801845] [2019-12-27 07:13:40,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:40,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:13:40,588 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725523572] [2019-12-27 07:13:40,593 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:40,594 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:40,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:40,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:40,612 INFO L87 Difference]: Start difference. First operand 27271 states. Second operand 3 states. [2019-12-27 07:13:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:41,818 INFO L93 Difference]: Finished difference Result 26946 states and 96635 transitions. [2019-12-27 07:13:41,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:41,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 07:13:41,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:42,044 INFO L225 Difference]: With dead ends: 26946 [2019-12-27 07:13:42,044 INFO L226 Difference]: Without dead ends: 25207 [2019-12-27 07:13:42,048 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-27 07:13:42,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25207 states. [2019-12-27 07:13:43,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25207 to 25207. [2019-12-27 07:13:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25207 states. [2019-12-27 07:13:43,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25207 states to 25207 states and 90336 transitions. [2019-12-27 07:13:43,608 INFO L78 Accepts]: Start accepts. Automaton has 25207 states and 90336 transitions. Word has length 5 [2019-12-27 07:13:43,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:43,610 INFO L462 AbstractCegarLoop]: Abstraction has 25207 states and 90336 transitions. [2019-12-27 07:13:43,611 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:43,611 INFO L276 IsEmpty]: Start isEmpty. Operand 25207 states and 90336 transitions. [2019-12-27 07:13:43,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 07:13:43,621 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:43,621 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:43,622 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:43,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:43,622 INFO L82 PathProgramCache]: Analyzing trace with hash -1479335670, now seen corresponding path program 1 times [2019-12-27 07:13:43,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:43,623 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593262416] [2019-12-27 07:13:43,623 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:43,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:43,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-27 07:13:43,776 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593262416] [2019-12-27 07:13:43,776 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:43,777 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:13:43,778 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952466169] [2019-12-27 07:13:43,779 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:43,780 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:43,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:43,781 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:43,781 INFO L87 Difference]: Start difference. First operand 25207 states and 90336 transitions. Second operand 4 states. [2019-12-27 07:13:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:44,404 INFO L93 Difference]: Finished difference Result 38966 states and 133479 transitions. [2019-12-27 07:13:44,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:13:44,405 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 07:13:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:44,580 INFO L225 Difference]: With dead ends: 38966 [2019-12-27 07:13:44,581 INFO L226 Difference]: Without dead ends: 38948 [2019-12-27 07:13:44,581 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-27 07:13:46,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38948 states. [2019-12-27 07:13:47,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38948 to 37967. [2019-12-27 07:13:47,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37967 states. [2019-12-27 07:13:47,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37967 states to 37967 states and 130916 transitions. [2019-12-27 07:13:47,444 INFO L78 Accepts]: Start accepts. Automaton has 37967 states and 130916 transitions. Word has length 11 [2019-12-27 07:13:47,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:47,444 INFO L462 AbstractCegarLoop]: Abstraction has 37967 states and 130916 transitions. [2019-12-27 07:13:47,444 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:13:47,444 INFO L276 IsEmpty]: Start isEmpty. Operand 37967 states and 130916 transitions. [2019-12-27 07:13:47,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 07:13:47,449 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:47,449 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:47,449 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:47,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:47,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1793441041, now seen corresponding path program 1 times [2019-12-27 07:13:47,450 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:47,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164757961] [2019-12-27 07:13:47,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:47,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:47,514 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-27 07:13:47,514 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164757961] [2019-12-27 07:13:47,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:47,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:13:47,516 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580399948] [2019-12-27 07:13:47,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:47,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:47,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:47,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:47,517 INFO L87 Difference]: Start difference. First operand 37967 states and 130916 transitions. Second operand 4 states. [2019-12-27 07:13:49,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:49,301 INFO L93 Difference]: Finished difference Result 48754 states and 165257 transitions. [2019-12-27 07:13:49,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:13:49,301 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-12-27 07:13:49,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:49,448 INFO L225 Difference]: With dead ends: 48754 [2019-12-27 07:13:49,448 INFO L226 Difference]: Without dead ends: 48739 [2019-12-27 07:13:49,450 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-27 07:13:50,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48739 states. [2019-12-27 07:13:51,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48739 to 43861. [2019-12-27 07:13:51,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43861 states. [2019-12-27 07:13:51,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43861 states to 43861 states and 150189 transitions. [2019-12-27 07:13:51,294 INFO L78 Accepts]: Start accepts. Automaton has 43861 states and 150189 transitions. Word has length 14 [2019-12-27 07:13:51,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:51,298 INFO L462 AbstractCegarLoop]: Abstraction has 43861 states and 150189 transitions. [2019-12-27 07:13:51,298 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:13:51,298 INFO L276 IsEmpty]: Start isEmpty. Operand 43861 states and 150189 transitions. [2019-12-27 07:13:51,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-27 07:13:51,303 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:51,303 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:51,304 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:51,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:51,304 INFO L82 PathProgramCache]: Analyzing trace with hash 237931436, now seen corresponding path program 1 times [2019-12-27 07:13:51,304 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:51,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649218795] [2019-12-27 07:13:51,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:51,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:51,389 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-27 07:13:51,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649218795] [2019-12-27 07:13:51,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:51,392 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:13:51,393 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183379039] [2019-12-27 07:13:51,393 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:51,393 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:51,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:51,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:51,394 INFO L87 Difference]: Start difference. First operand 43861 states and 150189 transitions. Second operand 3 states. [2019-12-27 07:13:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:52,076 INFO L93 Difference]: Finished difference Result 71282 states and 233582 transitions. [2019-12-27 07:13:52,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:52,076 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-27 07:13:52,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:52,224 INFO L225 Difference]: With dead ends: 71282 [2019-12-27 07:13:52,224 INFO L226 Difference]: Without dead ends: 71282 [2019-12-27 07:13:52,225 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:52,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71282 states. [2019-12-27 07:13:54,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71282 to 63620. [2019-12-27 07:13:54,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63620 states. [2019-12-27 07:13:54,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63620 states to 63620 states and 211773 transitions. [2019-12-27 07:13:54,317 INFO L78 Accepts]: Start accepts. Automaton has 63620 states and 211773 transitions. Word has length 15 [2019-12-27 07:13:54,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:54,318 INFO L462 AbstractCegarLoop]: Abstraction has 63620 states and 211773 transitions. [2019-12-27 07:13:54,318 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:54,318 INFO L276 IsEmpty]: Start isEmpty. Operand 63620 states and 211773 transitions. [2019-12-27 07:13:54,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 07:13:54,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:54,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:54,324 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:54,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:56,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1616735725, now seen corresponding path program 1 times [2019-12-27 07:13:56,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:56,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684410587] [2019-12-27 07:13:56,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:56,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:56,389 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-27 07:13:56,389 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [684410587] [2019-12-27 07:13:56,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:56,390 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:13:56,390 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747175653] [2019-12-27 07:13:56,390 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:13:56,391 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:56,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:13:56,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:13:56,391 INFO L87 Difference]: Start difference. First operand 63620 states and 211773 transitions. Second operand 3 states. [2019-12-27 07:13:56,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:56,621 INFO L93 Difference]: Finished difference Result 63517 states and 211446 transitions. [2019-12-27 07:13:56,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:13:56,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 07:13:56,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:56,768 INFO L225 Difference]: With dead ends: 63517 [2019-12-27 07:13:56,768 INFO L226 Difference]: Without dead ends: 63517 [2019-12-27 07:13:56,769 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-27 07:13:57,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63517 states. [2019-12-27 07:13:58,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63517 to 63517. [2019-12-27 07:13:58,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63517 states. [2019-12-27 07:13:58,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63517 states to 63517 states and 211446 transitions. [2019-12-27 07:13:58,449 INFO L78 Accepts]: Start accepts. Automaton has 63517 states and 211446 transitions. Word has length 16 [2019-12-27 07:13:58,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:13:58,449 INFO L462 AbstractCegarLoop]: Abstraction has 63517 states and 211446 transitions. [2019-12-27 07:13:58,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:13:58,449 INFO L276 IsEmpty]: Start isEmpty. Operand 63517 states and 211446 transitions. [2019-12-27 07:13:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:13:58,458 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:13:58,458 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:13:58,458 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:13:58,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:13:58,459 INFO L82 PathProgramCache]: Analyzing trace with hash 1032158122, now seen corresponding path program 1 times [2019-12-27 07:13:58,459 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:13:58,459 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537556513] [2019-12-27 07:13:58,459 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:13:58,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:13:58,505 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-27 07:13:58,505 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537556513] [2019-12-27 07:13:58,505 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:13:58,505 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:13:58,506 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166788212] [2019-12-27 07:13:58,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:13:58,506 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:13:58,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:13:58,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:13:58,507 INFO L87 Difference]: Start difference. First operand 63517 states and 211446 transitions. Second operand 4 states. [2019-12-27 07:13:59,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:13:59,482 INFO L93 Difference]: Finished difference Result 77880 states and 255480 transitions. [2019-12-27 07:13:59,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:13:59,483 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2019-12-27 07:13:59,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:13:59,643 INFO L225 Difference]: With dead ends: 77880 [2019-12-27 07:13:59,643 INFO L226 Difference]: Without dead ends: 77863 [2019-12-27 07:13:59,643 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-27 07:14:00,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77863 states. [2019-12-27 07:14:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77863 to 64071. [2019-12-27 07:14:03,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64071 states. [2019-12-27 07:14:03,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64071 states to 64071 states and 213322 transitions. [2019-12-27 07:14:03,402 INFO L78 Accepts]: Start accepts. Automaton has 64071 states and 213322 transitions. Word has length 17 [2019-12-27 07:14:03,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:03,402 INFO L462 AbstractCegarLoop]: Abstraction has 64071 states and 213322 transitions. [2019-12-27 07:14:03,403 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:03,403 INFO L276 IsEmpty]: Start isEmpty. Operand 64071 states and 213322 transitions. [2019-12-27 07:14:03,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-27 07:14:03,412 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:03,412 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 07:14:03,412 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:03,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:03,413 INFO L82 PathProgramCache]: Analyzing trace with hash 274413131, now seen corresponding path program 1 times [2019-12-27 07:14:03,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:03,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201155287] [2019-12-27 07:14:03,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:03,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:03,455 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-27 07:14:03,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201155287] [2019-12-27 07:14:03,455 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:03,455 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 07:14:03,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304535932] [2019-12-27 07:14:03,456 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:03,456 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:03,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:03,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:03,457 INFO L87 Difference]: Start difference. First operand 64071 states and 213322 transitions. Second operand 3 states. [2019-12-27 07:14:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:03,717 INFO L93 Difference]: Finished difference Result 60500 states and 201181 transitions. [2019-12-27 07:14:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:03,717 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-12-27 07:14:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:03,833 INFO L225 Difference]: With dead ends: 60500 [2019-12-27 07:14:03,833 INFO L226 Difference]: Without dead ends: 60374 [2019-12-27 07:14:03,833 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-27 07:14:04,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60374 states. [2019-12-27 07:14:05,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60374 to 60374. [2019-12-27 07:14:05,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60374 states. [2019-12-27 07:14:05,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60374 states to 60374 states and 200794 transitions. [2019-12-27 07:14:05,722 INFO L78 Accepts]: Start accepts. Automaton has 60374 states and 200794 transitions. Word has length 17 [2019-12-27 07:14:05,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:05,722 INFO L462 AbstractCegarLoop]: Abstraction has 60374 states and 200794 transitions. [2019-12-27 07:14:05,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 60374 states and 200794 transitions. [2019-12-27 07:14:05,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 07:14:05,735 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:05,736 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] [2019-12-27 07:14:05,736 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:05,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:05,736 INFO L82 PathProgramCache]: Analyzing trace with hash 363158557, now seen corresponding path program 1 times [2019-12-27 07:14:05,736 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:05,737 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101118201] [2019-12-27 07:14:05,737 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:05,798 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-27 07:14:05,800 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101118201] [2019-12-27 07:14:05,800 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:05,801 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:05,801 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1791073488] [2019-12-27 07:14:05,801 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:14:05,801 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:05,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:14:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:14:05,802 INFO L87 Difference]: Start difference. First operand 60374 states and 200794 transitions. Second operand 5 states. [2019-12-27 07:14:08,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:08,489 INFO L93 Difference]: Finished difference Result 84981 states and 275357 transitions. [2019-12-27 07:14:08,490 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:14:08,490 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-12-27 07:14:08,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:08,660 INFO L225 Difference]: With dead ends: 84981 [2019-12-27 07:14:08,660 INFO L226 Difference]: Without dead ends: 84967 [2019-12-27 07:14:08,660 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:14:09,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84967 states. [2019-12-27 07:14:10,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84967 to 65930. [2019-12-27 07:14:10,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65930 states. [2019-12-27 07:14:10,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65930 states to 65930 states and 218108 transitions. [2019-12-27 07:14:10,665 INFO L78 Accepts]: Start accepts. Automaton has 65930 states and 218108 transitions. Word has length 20 [2019-12-27 07:14:10,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:10,665 INFO L462 AbstractCegarLoop]: Abstraction has 65930 states and 218108 transitions. [2019-12-27 07:14:10,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:14:10,666 INFO L276 IsEmpty]: Start isEmpty. Operand 65930 states and 218108 transitions. [2019-12-27 07:14:10,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-27 07:14:10,686 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:10,686 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] [2019-12-27 07:14:10,686 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:10,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:10,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1131596126, now seen corresponding path program 1 times [2019-12-27 07:14:10,686 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:10,687 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144300433] [2019-12-27 07:14:10,687 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:10,740 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-27 07:14:10,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144300433] [2019-12-27 07:14:10,741 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:10,741 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:10,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878225155] [2019-12-27 07:14:10,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:14:10,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:10,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:14:10,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:14:10,742 INFO L87 Difference]: Start difference. First operand 65930 states and 218108 transitions. Second operand 5 states. [2019-12-27 07:14:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:11,668 INFO L93 Difference]: Finished difference Result 89060 states and 288103 transitions. [2019-12-27 07:14:11,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 07:14:11,672 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2019-12-27 07:14:11,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:11,841 INFO L225 Difference]: With dead ends: 89060 [2019-12-27 07:14:11,842 INFO L226 Difference]: Without dead ends: 89032 [2019-12-27 07:14:11,842 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:14:12,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89032 states. [2019-12-27 07:14:14,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89032 to 61456. [2019-12-27 07:14:14,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61456 states. [2019-12-27 07:14:14,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61456 states to 61456 states and 203832 transitions. [2019-12-27 07:14:14,182 INFO L78 Accepts]: Start accepts. Automaton has 61456 states and 203832 transitions. Word has length 23 [2019-12-27 07:14:14,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:14,182 INFO L462 AbstractCegarLoop]: Abstraction has 61456 states and 203832 transitions. [2019-12-27 07:14:14,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:14:14,183 INFO L276 IsEmpty]: Start isEmpty. Operand 61456 states and 203832 transitions. [2019-12-27 07:14:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:14:14,240 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:14,240 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] [2019-12-27 07:14:14,240 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:14,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:14,240 INFO L82 PathProgramCache]: Analyzing trace with hash -936804425, now seen corresponding path program 1 times [2019-12-27 07:14:14,240 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:14,241 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620768975] [2019-12-27 07:14:14,241 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:14,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:14,334 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-27 07:14:14,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620768975] [2019-12-27 07:14:14,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:14,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:14:14,336 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104360570] [2019-12-27 07:14:14,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:14,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:14,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:14,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:14,337 INFO L87 Difference]: Start difference. First operand 61456 states and 203832 transitions. Second operand 4 states. [2019-12-27 07:14:15,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:15,567 INFO L93 Difference]: Finished difference Result 115204 states and 375009 transitions. [2019-12-27 07:14:15,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:14:15,567 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-12-27 07:14:15,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:15,777 INFO L225 Difference]: With dead ends: 115204 [2019-12-27 07:14:15,777 INFO L226 Difference]: Without dead ends: 115204 [2019-12-27 07:14:15,777 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-27 07:14:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115204 states. [2019-12-27 07:14:20,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115204 to 78853. [2019-12-27 07:14:20,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78853 states. [2019-12-27 07:14:20,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78853 states to 78853 states and 262373 transitions. [2019-12-27 07:14:20,901 INFO L78 Accepts]: Start accepts. Automaton has 78853 states and 262373 transitions. Word has length 31 [2019-12-27 07:14:20,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:20,902 INFO L462 AbstractCegarLoop]: Abstraction has 78853 states and 262373 transitions. [2019-12-27 07:14:20,902 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:20,902 INFO L276 IsEmpty]: Start isEmpty. Operand 78853 states and 262373 transitions. [2019-12-27 07:14:20,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 07:14:20,961 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:20,961 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] [2019-12-27 07:14:20,962 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:20,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:20,962 INFO L82 PathProgramCache]: Analyzing trace with hash -372180425, now seen corresponding path program 2 times [2019-12-27 07:14:20,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:20,962 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712895416] [2019-12-27 07:14:20,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:21,007 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-27 07:14:21,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712895416] [2019-12-27 07:14:21,008 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:21,008 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 07:14:21,009 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331042223] [2019-12-27 07:14:21,009 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 07:14:21,009 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:21,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 07:14:21,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 07:14:21,010 INFO L87 Difference]: Start difference. First operand 78853 states and 262373 transitions. Second operand 3 states. [2019-12-27 07:14:21,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:21,302 INFO L93 Difference]: Finished difference Result 73759 states and 241892 transitions. [2019-12-27 07:14:21,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 07:14:21,302 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-12-27 07:14:21,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:21,438 INFO L225 Difference]: With dead ends: 73759 [2019-12-27 07:14:21,438 INFO L226 Difference]: Without dead ends: 73759 [2019-12-27 07:14:21,438 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-27 07:14:22,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73759 states. [2019-12-27 07:14:23,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73759 to 72519. [2019-12-27 07:14:23,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72519 states. [2019-12-27 07:14:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72519 states to 72519 states and 238188 transitions. [2019-12-27 07:14:23,564 INFO L78 Accepts]: Start accepts. Automaton has 72519 states and 238188 transitions. Word has length 31 [2019-12-27 07:14:23,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:23,564 INFO L462 AbstractCegarLoop]: Abstraction has 72519 states and 238188 transitions. [2019-12-27 07:14:23,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 07:14:23,564 INFO L276 IsEmpty]: Start isEmpty. Operand 72519 states and 238188 transitions. [2019-12-27 07:14:23,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:23,630 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:23,630 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] [2019-12-27 07:14:23,631 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:23,631 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:23,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1732188204, now seen corresponding path program 1 times [2019-12-27 07:14:23,631 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:23,632 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443557422] [2019-12-27 07:14:23,632 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:23,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:23,720 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-27 07:14:23,721 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443557422] [2019-12-27 07:14:23,721 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:23,721 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:23,721 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568997044] [2019-12-27 07:14:23,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:23,722 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:23,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:23,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:23,723 INFO L87 Difference]: Start difference. First operand 72519 states and 238188 transitions. Second operand 7 states. [2019-12-27 07:14:24,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:24,708 INFO L93 Difference]: Finished difference Result 163297 states and 534962 transitions. [2019-12-27 07:14:24,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:14:24,708 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:24,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:24,980 INFO L225 Difference]: With dead ends: 163297 [2019-12-27 07:14:24,981 INFO L226 Difference]: Without dead ends: 132243 [2019-12-27 07:14:24,981 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:14:25,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132243 states. [2019-12-27 07:14:28,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132243 to 115117. [2019-12-27 07:14:28,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115117 states. [2019-12-27 07:14:28,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115117 states to 115117 states and 379630 transitions. [2019-12-27 07:14:28,600 INFO L78 Accepts]: Start accepts. Automaton has 115117 states and 379630 transitions. Word has length 32 [2019-12-27 07:14:28,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:28,600 INFO L462 AbstractCegarLoop]: Abstraction has 115117 states and 379630 transitions. [2019-12-27 07:14:28,600 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:28,600 INFO L276 IsEmpty]: Start isEmpty. Operand 115117 states and 379630 transitions. [2019-12-27 07:14:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:28,698 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:28,698 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] [2019-12-27 07:14:28,698 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:28,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:28,699 INFO L82 PathProgramCache]: Analyzing trace with hash 597590804, now seen corresponding path program 2 times [2019-12-27 07:14:28,699 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:28,699 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336245728] [2019-12-27 07:14:28,699 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:28,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:32,191 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-27 07:14:32,191 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336245728] [2019-12-27 07:14:32,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:32,192 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 07:14:32,192 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373348033] [2019-12-27 07:14:32,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 07:14:32,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:32,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 07:14:32,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:32,193 INFO L87 Difference]: Start difference. First operand 115117 states and 379630 transitions. Second operand 7 states. [2019-12-27 07:14:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:33,874 INFO L93 Difference]: Finished difference Result 207257 states and 684282 transitions. [2019-12-27 07:14:33,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-12-27 07:14:33,875 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-12-27 07:14:33,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:34,299 INFO L225 Difference]: With dead ends: 207257 [2019-12-27 07:14:34,299 INFO L226 Difference]: Without dead ends: 195003 [2019-12-27 07:14:34,300 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2019-12-27 07:14:35,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195003 states. [2019-12-27 07:14:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195003 to 115111. [2019-12-27 07:14:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115111 states. [2019-12-27 07:14:38,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115111 states to 115111 states and 379657 transitions. [2019-12-27 07:14:38,181 INFO L78 Accepts]: Start accepts. Automaton has 115111 states and 379657 transitions. Word has length 32 [2019-12-27 07:14:38,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:38,181 INFO L462 AbstractCegarLoop]: Abstraction has 115111 states and 379657 transitions. [2019-12-27 07:14:38,182 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 07:14:38,182 INFO L276 IsEmpty]: Start isEmpty. Operand 115111 states and 379657 transitions. [2019-12-27 07:14:38,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-27 07:14:38,280 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:38,280 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] [2019-12-27 07:14:38,280 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:38,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:38,281 INFO L82 PathProgramCache]: Analyzing trace with hash 1306987540, now seen corresponding path program 3 times [2019-12-27 07:14:38,281 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:38,281 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694035343] [2019-12-27 07:14:38,281 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:38,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:38,374 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-27 07:14:38,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694035343] [2019-12-27 07:14:38,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:38,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:14:38,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273483487] [2019-12-27 07:14:38,376 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 07:14:38,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:38,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 07:14:38,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 07:14:38,377 INFO L87 Difference]: Start difference. First operand 115111 states and 379657 transitions. Second operand 9 states. [2019-12-27 07:14:40,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:40,440 INFO L93 Difference]: Finished difference Result 196979 states and 647215 transitions. [2019-12-27 07:14:40,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 07:14:40,440 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2019-12-27 07:14:40,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:40,827 INFO L225 Difference]: With dead ends: 196979 [2019-12-27 07:14:40,827 INFO L226 Difference]: Without dead ends: 185389 [2019-12-27 07:14:40,828 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=407, Unknown=0, NotChecked=0, Total=552 [2019-12-27 07:14:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185389 states. [2019-12-27 07:14:47,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185389 to 115934. [2019-12-27 07:14:47,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115934 states. [2019-12-27 07:14:48,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115934 states to 115934 states and 382219 transitions. [2019-12-27 07:14:48,190 INFO L78 Accepts]: Start accepts. Automaton has 115934 states and 382219 transitions. Word has length 32 [2019-12-27 07:14:48,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:48,190 INFO L462 AbstractCegarLoop]: Abstraction has 115934 states and 382219 transitions. [2019-12-27 07:14:48,190 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 07:14:48,190 INFO L276 IsEmpty]: Start isEmpty. Operand 115934 states and 382219 transitions. [2019-12-27 07:14:48,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 07:14:48,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:48,295 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] [2019-12-27 07:14:48,296 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:48,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:48,296 INFO L82 PathProgramCache]: Analyzing trace with hash 4490691, now seen corresponding path program 1 times [2019-12-27 07:14:48,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:48,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361703357] [2019-12-27 07:14:48,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:48,355 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-27 07:14:48,355 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361703357] [2019-12-27 07:14:48,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:48,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:48,356 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972558503] [2019-12-27 07:14:48,356 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:48,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:48,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:48,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:48,357 INFO L87 Difference]: Start difference. First operand 115934 states and 382219 transitions. Second operand 4 states. [2019-12-27 07:14:48,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:48,445 INFO L93 Difference]: Finished difference Result 17167 states and 47358 transitions. [2019-12-27 07:14:48,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:14:48,445 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2019-12-27 07:14:48,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:48,459 INFO L225 Difference]: With dead ends: 17167 [2019-12-27 07:14:48,459 INFO L226 Difference]: Without dead ends: 9939 [2019-12-27 07:14:48,459 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-27 07:14:48,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9939 states. [2019-12-27 07:14:48,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9939 to 9560. [2019-12-27 07:14:48,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9560 states. [2019-12-27 07:14:48,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9560 states to 9560 states and 22505 transitions. [2019-12-27 07:14:48,572 INFO L78 Accepts]: Start accepts. Automaton has 9560 states and 22505 transitions. Word has length 33 [2019-12-27 07:14:48,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:48,572 INFO L462 AbstractCegarLoop]: Abstraction has 9560 states and 22505 transitions. [2019-12-27 07:14:48,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 9560 states and 22505 transitions. [2019-12-27 07:14:48,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 07:14:48,581 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:48,581 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] [2019-12-27 07:14:48,581 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:48,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:48,581 INFO L82 PathProgramCache]: Analyzing trace with hash 2021850497, now seen corresponding path program 1 times [2019-12-27 07:14:48,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:48,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710567095] [2019-12-27 07:14:48,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:48,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:48,642 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-27 07:14:48,642 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710567095] [2019-12-27 07:14:48,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:48,643 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 07:14:48,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763119218] [2019-12-27 07:14:48,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 07:14:48,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:48,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 07:14:48,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 07:14:48,647 INFO L87 Difference]: Start difference. First operand 9560 states and 22505 transitions. Second operand 4 states. [2019-12-27 07:14:48,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:48,689 INFO L93 Difference]: Finished difference Result 10710 states and 25125 transitions. [2019-12-27 07:14:48,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 07:14:48,689 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 44 [2019-12-27 07:14:48,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:48,701 INFO L225 Difference]: With dead ends: 10710 [2019-12-27 07:14:48,702 INFO L226 Difference]: Without dead ends: 8709 [2019-12-27 07:14:48,702 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-27 07:14:48,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8709 states. [2019-12-27 07:14:48,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8709 to 8237. [2019-12-27 07:14:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8237 states. [2019-12-27 07:14:48,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8237 states to 8237 states and 19464 transitions. [2019-12-27 07:14:48,832 INFO L78 Accepts]: Start accepts. Automaton has 8237 states and 19464 transitions. Word has length 44 [2019-12-27 07:14:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:48,833 INFO L462 AbstractCegarLoop]: Abstraction has 8237 states and 19464 transitions. [2019-12-27 07:14:48,833 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 07:14:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 8237 states and 19464 transitions. [2019-12-27 07:14:48,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-12-27 07:14:48,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:48,840 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] [2019-12-27 07:14:48,840 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:48,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:48,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1006962917, now seen corresponding path program 2 times [2019-12-27 07:14:48,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:48,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439452180] [2019-12-27 07:14:48,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:48,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:48,933 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-27 07:14:48,934 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439452180] [2019-12-27 07:14:48,934 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:48,934 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 07:14:48,935 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773854641] [2019-12-27 07:14:48,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 07:14:48,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:48,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 07:14:48,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 07:14:48,937 INFO L87 Difference]: Start difference. First operand 8237 states and 19464 transitions. Second operand 5 states. [2019-12-27 07:14:49,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:49,002 INFO L93 Difference]: Finished difference Result 6325 states and 15094 transitions. [2019-12-27 07:14:49,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 07:14:49,003 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 44 [2019-12-27 07:14:49,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:49,004 INFO L225 Difference]: With dead ends: 6325 [2019-12-27 07:14:49,004 INFO L226 Difference]: Without dead ends: 696 [2019-12-27 07:14:49,004 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 07:14:49,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 696 states. [2019-12-27 07:14:49,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 696 to 692. [2019-12-27 07:14:49,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-12-27 07:14:49,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1524 transitions. [2019-12-27 07:14:49,015 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1524 transitions. Word has length 44 [2019-12-27 07:14:49,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:49,015 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 1524 transitions. [2019-12-27 07:14:49,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 07:14:49,015 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1524 transitions. [2019-12-27 07:14:49,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:14:49,017 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:49,017 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] [2019-12-27 07:14:49,017 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:49,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:49,017 INFO L82 PathProgramCache]: Analyzing trace with hash -234128232, now seen corresponding path program 1 times [2019-12-27 07:14:49,018 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:49,018 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325224059] [2019-12-27 07:14:49,018 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 07:14:49,120 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-27 07:14:49,120 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325224059] [2019-12-27 07:14:49,121 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 07:14:49,121 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 07:14:49,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049226374] [2019-12-27 07:14:49,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 07:14:49,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 07:14:49,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 07:14:49,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-12-27 07:14:49,122 INFO L87 Difference]: Start difference. First operand 692 states and 1524 transitions. Second operand 8 states. [2019-12-27 07:14:49,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 07:14:49,319 INFO L93 Difference]: Finished difference Result 1253 states and 2705 transitions. [2019-12-27 07:14:49,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 07:14:49,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 60 [2019-12-27 07:14:49,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 07:14:49,321 INFO L225 Difference]: With dead ends: 1253 [2019-12-27 07:14:49,321 INFO L226 Difference]: Without dead ends: 930 [2019-12-27 07:14:49,321 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2019-12-27 07:14:49,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 930 states. [2019-12-27 07:14:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 930 to 768. [2019-12-27 07:14:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 768 states. [2019-12-27 07:14:49,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 768 states to 768 states and 1655 transitions. [2019-12-27 07:14:49,329 INFO L78 Accepts]: Start accepts. Automaton has 768 states and 1655 transitions. Word has length 60 [2019-12-27 07:14:49,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 07:14:49,330 INFO L462 AbstractCegarLoop]: Abstraction has 768 states and 1655 transitions. [2019-12-27 07:14:49,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 07:14:49,330 INFO L276 IsEmpty]: Start isEmpty. Operand 768 states and 1655 transitions. [2019-12-27 07:14:49,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-27 07:14:49,331 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 07:14:49,331 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] [2019-12-27 07:14:49,331 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 07:14:49,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 07:14:49,331 INFO L82 PathProgramCache]: Analyzing trace with hash 663982360, now seen corresponding path program 2 times [2019-12-27 07:14:49,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 07:14:49,331 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681261551] [2019-12-27 07:14:49,331 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 07:14:49,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:14:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 07:14:49,447 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 07:14:49,447 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 07:14:49,452 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [976] [976] ULTIMATE.startENTRY-->L813: Formula: (let ((.cse0 (store |v_#valid_43| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= 0 v_~y$r_buff1_thd2~0_36) (= 0 v_~weak$$choice0~0_10) (= (select .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_21|) 0) (< 0 |v_#StackHeapBarrier_12|) (= 0 v_~y$read_delayed_var~0.offset_7) (= v_~__unbuffered_p1_EBX~0_17 0) (= 0 v_~__unbuffered_p1_EAX~0_18) (= v_~y$read_delayed~0_7 0) (= v_~y$r_buff0_thd1~0_53 0) (= v_~main$tmp_guard0~0_12 0) (= |v_#NULL.offset_3| 0) (= 0 v_~y$r_buff1_thd0~0_22) (= v_~y$mem_tmp~0_13 0) (= 0 v_~x~0_9) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1727~0.base_21|) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1727~0.base_21| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t1727~0.base_21|) |v_ULTIMATE.start_main_~#t1727~0.offset_17| 0)) |v_#memory_int_15|) (= 0 v_~y$flush_delayed~0_18) (= v_~y$w_buff0_used~0_130 0) (= v_~y$r_buff0_thd2~0_75 0) (= 0 v_~y$read_delayed_var~0.base_7) (= v_~y$r_buff0_thd0~0_23 0) (= v_~y~0_32 0) (= 0 v_~weak$$choice2~0_35) (= 0 v_~y$w_buff1~0_32) (= 0 v_~__unbuffered_p0_EAX~0_16) (= 0 |v_#NULL.base_3|) (= 0 v_~y$r_buff1_thd1~0_27) (= v_~y$w_buff1_used~0_64 0) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1727~0.base_21| 4)) (= v_~__unbuffered_p0_EBX~0_17 0) (= 0 v_~y$w_buff0~0_35) (= (store .cse0 |v_ULTIMATE.start_main_~#t1727~0.base_21| 1) |v_#valid_41|) (= |v_ULTIMATE.start_main_~#t1727~0.offset_17| 0) (= 0 v_~__unbuffered_cnt~0_16))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_130, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_9|, ULTIMATE.start_main_#t~nondet56=|v_ULTIMATE.start_main_#t~nondet56_7|, #NULL.offset=|v_#NULL.offset_3|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_~#t1727~0.offset=|v_ULTIMATE.start_main_~#t1727~0.offset_17|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_27, ~y$mem_tmp~0=v_~y$mem_tmp~0_13, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_16, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_18, ~y$w_buff0~0=v_~y$w_buff0~0_35, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_53, ~y$flush_delayed~0=v_~y$flush_delayed~0_18, #length=|v_#length_17|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_18|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_15|, ~y~0=v_~y~0_32, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_17, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_17, ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_13|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_12|, ULTIMATE.start_main_#t~ite59=|v_ULTIMATE.start_main_#t~ite59_10|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_12, #NULL.base=|v_#NULL.base_3|, ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_24|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_36, ~weak$$choice0~0=v_~weak$$choice0~0_10, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~ite60=|v_ULTIMATE.start_main_#t~ite60_10|, ULTIMATE.start_main_#t~ite61=|v_ULTIMATE.start_main_#t~ite61_10|, ~y$w_buff1~0=v_~y$w_buff1~0_32, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_23, #valid=|v_#valid_41|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_75, #memory_int=|v_#memory_int_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, ULTIMATE.start_main_~#t1727~0.base=|v_ULTIMATE.start_main_~#t1727~0.base_21|, ~weak$$choice2~0=v_~weak$$choice2~0_35, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_22, ~x~0=v_~x~0_9, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_64} AuxVars[] AssignedVars[~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~nondet55, ULTIMATE.start_main_#t~nondet56, #NULL.offset, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t1727~0.offset, ~y$read_delayed~0, ~y$r_buff1_thd1~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~y$w_buff0~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset, ~y~0, ~__unbuffered_p1_EBX~0, ~__unbuffered_p0_EBX~0, ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ULTIMATE.start_main_#t~ite59, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#t~ite62, ~y$r_buff1_thd2~0, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite60, ULTIMATE.start_main_#t~ite61, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, ~y$r_buff0_thd2~0, #memory_int, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t1727~0.base, ~weak$$choice2~0, ~y$r_buff1_thd0~0, ~x~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:14:49,453 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [950] [950] L813-1-->L815: Formula: (and (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1728~0.base_13|) |v_ULTIMATE.start_main_~#t1728~0.offset_11| 1))) (= (select |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13|) 0) (= |v_#valid_25| (store |v_#valid_26| |v_ULTIMATE.start_main_~#t1728~0.base_13| 1)) (< |v_#StackHeapBarrier_8| |v_ULTIMATE.start_main_~#t1728~0.base_13|) (= |v_ULTIMATE.start_main_~#t1728~0.offset_11| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1728~0.base_13|)) (= |v_#length_11| (store |v_#length_12| |v_ULTIMATE.start_main_~#t1728~0.base_13| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_8|, #valid=|v_#valid_26|, #memory_int=|v_#memory_int_10|, #length=|v_#length_12|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_8|, ULTIMATE.start_main_#t~nondet55=|v_ULTIMATE.start_main_#t~nondet55_6|, #valid=|v_#valid_25|, #memory_int=|v_#memory_int_9|, #length=|v_#length_11|, ULTIMATE.start_main_~#t1728~0.base=|v_ULTIMATE.start_main_~#t1728~0.base_13|, ULTIMATE.start_main_~#t1728~0.offset=|v_ULTIMATE.start_main_~#t1728~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet55, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1728~0.base, ULTIMATE.start_main_~#t1728~0.offset] because there is no mapped edge [2019-12-27 07:14:49,454 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [862] [862] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|) (= 1 v_~y$w_buff0_used~0_98) (= 1 v_~y$w_buff0~0_22) (= v_~y$w_buff1_used~0_53 v_~y$w_buff0_used~0_99) (= |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4| 1) (= |v_P1Thread1of1ForFork1_#in~arg.offset_4| v_P1Thread1of1ForFork1_~arg.offset_4) (= v_P1Thread1of1ForFork1_~arg.base_4 |v_P1Thread1of1ForFork1_#in~arg.base_4|) (= v_~y$w_buff0~0_23 v_~y$w_buff1~0_24) (= (mod v_~y$w_buff1_used~0_53 256) 0)) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_99, ~y$w_buff0~0=v_~y$w_buff0~0_23, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_6, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_4, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_98, ~y$w_buff1~0=v_~y$w_buff1~0_24, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_4|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_4, ~y$w_buff0~0=v_~y$w_buff0~0_22, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_4|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_4|, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_53} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, P1Thread1of1ForFork1_~arg.offset, ~y$w_buff0_used~0, ~y$w_buff1~0, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~y$w_buff0~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-27 07:14:49,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [914] [914] L775-2-->L775-4: Formula: (let ((.cse1 (= (mod ~y$w_buff0_used~0_In463732970 256) 0)) (.cse0 (= (mod ~y$r_buff0_thd2~0_In463732970 256) 0))) (or (and (= ~y$w_buff1~0_In463732970 |P1Thread1of1ForFork1_#t~ite28_Out463732970|) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite28_Out463732970| ~y$w_buff0~0_In463732970) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In463732970, ~y$w_buff1~0=~y$w_buff1~0_In463732970, ~y$w_buff0~0=~y$w_buff0~0_In463732970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In463732970} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In463732970, ~y$w_buff1~0=~y$w_buff1~0_In463732970, ~y$w_buff0~0=~y$w_buff0~0_In463732970, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In463732970, P1Thread1of1ForFork1_#t~ite28=|P1Thread1of1ForFork1_#t~ite28_Out463732970|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:14:49,457 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [884] [884] L775-4-->L776: Formula: (= v_~y~0_22 |v_P1Thread1of1ForFork1_#t~ite28_8|) InVars {P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_8|} OutVars{P1Thread1of1ForFork1_#t~ite29=|v_P1Thread1of1ForFork1_#t~ite29_7|, ~y~0=v_~y~0_22, P1Thread1of1ForFork1_#t~ite28=|v_P1Thread1of1ForFork1_#t~ite28_7|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite29, ~y~0, P1Thread1of1ForFork1_#t~ite28] because there is no mapped edge [2019-12-27 07:14:49,464 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L780-->L781: Formula: (and (= v_~y$r_buff0_thd2~0_53 v_~y$r_buff0_thd2~0_52) (not (= (mod v_~weak$$choice2~0_28 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_53, ~weak$$choice2~0=v_~weak$$choice2~0_28} OutVars{P1Thread1of1ForFork1_#t~ite42=|v_P1Thread1of1ForFork1_#t~ite42_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_52, P1Thread1of1ForFork1_#t~ite44=|v_P1Thread1of1ForFork1_#t~ite44_9|, P1Thread1of1ForFork1_#t~ite43=|v_P1Thread1of1ForFork1_#t~ite43_9|, ~weak$$choice2~0=v_~weak$$choice2~0_28} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite42, ~y$r_buff0_thd2~0, P1Thread1of1ForFork1_#t~ite44, P1Thread1of1ForFork1_#t~ite43] because there is no mapped edge [2019-12-27 07:14:49,465 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [915] [915] L783-->L783-2: Formula: (let ((.cse0 (= 0 (mod ~y$flush_delayed~0_In-445629599 256)))) (or (and (not .cse0) (= ~y$mem_tmp~0_In-445629599 |P1Thread1of1ForFork1_#t~ite48_Out-445629599|)) (and (= ~y~0_In-445629599 |P1Thread1of1ForFork1_#t~ite48_Out-445629599|) .cse0))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In-445629599, ~y$flush_delayed~0=~y$flush_delayed~0_In-445629599, ~y~0=~y~0_In-445629599} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In-445629599, ~y$flush_delayed~0=~y$flush_delayed~0_In-445629599, ~y~0=~y~0_In-445629599, P1Thread1of1ForFork1_#t~ite48=|P1Thread1of1ForFork1_#t~ite48_Out-445629599|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite48] because there is no mapped edge [2019-12-27 07:14:49,470 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [936] [936] L791-->L791-2: Formula: (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In665906293 256))) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In665906293 256)))) (or (and (= |P1Thread1of1ForFork1_#t~ite51_Out665906293| 0) (not .cse0) (not .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite51_Out665906293| ~y$w_buff0_used~0_In665906293) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In665906293, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In665906293} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In665906293, P1Thread1of1ForFork1_#t~ite51=|P1Thread1of1ForFork1_#t~ite51_Out665906293|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In665906293} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite51] because there is no mapped edge [2019-12-27 07:14:49,471 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [916] [916] L792-->L792-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In58793175 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd2~0_In58793175 256))) (.cse3 (= (mod ~y$r_buff0_thd2~0_In58793175 256) 0)) (.cse2 (= (mod ~y$w_buff0_used~0_In58793175 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork1_#t~ite52_Out58793175| ~y$w_buff1_used~0_In58793175)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P1Thread1of1ForFork1_#t~ite52_Out58793175| 0)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In58793175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In58793175, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In58793175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In58793175} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In58793175, ~y$w_buff0_used~0=~y$w_buff0_used~0_In58793175, P1Thread1of1ForFork1_#t~ite52=|P1Thread1of1ForFork1_#t~ite52_Out58793175|, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In58793175, ~y$w_buff1_used~0=~y$w_buff1_used~0_In58793175} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite52] because there is no mapped edge [2019-12-27 07:14:49,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [932] [932] L793-->L794: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd2~0_In-1462434582 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1462434582 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff0_thd2~0_In-1462434582 ~y$r_buff0_thd2~0_Out-1462434582)) (and (not .cse1) (not .cse0) (= 0 ~y$r_buff0_thd2~0_Out-1462434582)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1462434582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1462434582} OutVars{P1Thread1of1ForFork1_#t~ite53=|P1Thread1of1ForFork1_#t~ite53_Out-1462434582|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1462434582, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_Out-1462434582} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite53, ~y$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 07:14:49,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [937] [937] L794-->L794-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1119859701 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In-1119859701 256))) (.cse2 (= (mod ~y$w_buff1_used~0_In-1119859701 256) 0)) (.cse3 (= 0 (mod ~y$r_buff1_thd2~0_In-1119859701 256)))) (or (and (or .cse0 .cse1) (= ~y$r_buff1_thd2~0_In-1119859701 |P1Thread1of1ForFork1_#t~ite54_Out-1119859701|) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork1_#t~ite54_Out-1119859701|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1119859701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1119859701, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1119859701, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1119859701} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-1119859701, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1119859701, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-1119859701, P1Thread1of1ForFork1_#t~ite54=|P1Thread1of1ForFork1_#t~ite54_Out-1119859701|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1119859701} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite54] because there is no mapped edge [2019-12-27 07:14:49,472 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [940] [940] L794-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~__unbuffered_cnt~0_8 (+ v_~__unbuffered_cnt~0_9 1)) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= v_~y$r_buff1_thd2~0_31 |v_P1Thread1of1ForFork1_#t~ite54_8|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_9, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_8|} OutVars{~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_31, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_8, P1Thread1of1ForFork1_#t~ite54=|v_P1Thread1of1ForFork1_#t~ite54_7|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[~y$r_buff1_thd2~0, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite54, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-27 07:14:49,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [921] [921] L747-->L747-2: Formula: (let ((.cse0 (= (mod ~y$flush_delayed~0_In913398951 256) 0))) (or (and .cse0 (= |P0Thread1of1ForFork0_#t~ite25_Out913398951| ~y~0_In913398951)) (and (not .cse0) (= ~y$mem_tmp~0_In913398951 |P0Thread1of1ForFork0_#t~ite25_Out913398951|)))) InVars {~y$mem_tmp~0=~y$mem_tmp~0_In913398951, ~y$flush_delayed~0=~y$flush_delayed~0_In913398951, ~y~0=~y~0_In913398951} OutVars{~y$mem_tmp~0=~y$mem_tmp~0_In913398951, P0Thread1of1ForFork0_#t~ite25=|P0Thread1of1ForFork0_#t~ite25_Out913398951|, ~y$flush_delayed~0=~y$flush_delayed~0_In913398951, ~y~0=~y~0_In913398951} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25] because there is no mapped edge [2019-12-27 07:14:49,483 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [942] [942] L747-2-->P0EXIT: Formula: (and (= 0 v_~y$flush_delayed~0_12) (= v_~y~0_26 |v_P0Thread1of1ForFork0_#t~ite25_8|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11} OutVars{P0Thread1of1ForFork0_#t~ite25=|v_P0Thread1of1ForFork0_#t~ite25_7|, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~y$flush_delayed~0=v_~y$flush_delayed~0_12, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~y~0=v_~y~0_26} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite25, P0Thread1of1ForFork0_#res.offset, ~y$flush_delayed~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~y~0] because there is no mapped edge [2019-12-27 07:14:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L819-->L821-2: Formula: (and (not (= 0 (mod v_~main$tmp_guard0~0_5 256))) (or (= 0 (mod v_~y$r_buff0_thd0~0_16 256)) (= (mod v_~y$w_buff0_used~0_106 256) 0))) InVars {~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~y$w_buff0_used~0=v_~y$w_buff0_used~0_106, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_16, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 07:14:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [917] [917] L821-2-->L821-4: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1112555735 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In-1112555735 256)))) (or (and (not .cse0) (= ~y$w_buff1~0_In-1112555735 |ULTIMATE.start_main_#t~ite57_Out-1112555735|) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite57_Out-1112555735| ~y~0_In-1112555735) (or .cse1 .cse0)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-1112555735, ~y~0=~y~0_In-1112555735, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1112555735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112555735} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-1112555735, ULTIMATE.start_main_#t~ite57=|ULTIMATE.start_main_#t~ite57_Out-1112555735|, ~y~0=~y~0_In-1112555735, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1112555735, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1112555735} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite57] because there is no mapped edge [2019-12-27 07:14:49,484 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L821-4-->L822: Formula: (= v_~y~0_19 |v_ULTIMATE.start_main_#t~ite57_7|) InVars {ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_7|} OutVars{ULTIMATE.start_main_#t~ite58=|v_ULTIMATE.start_main_#t~ite58_6|, ULTIMATE.start_main_#t~ite57=|v_ULTIMATE.start_main_#t~ite57_6|, ~y~0=v_~y~0_19} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite58, ULTIMATE.start_main_#t~ite57, ~y~0] because there is no mapped edge [2019-12-27 07:14:49,485 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [926] [926] L822-->L822-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1997207448 256))) (.cse0 (= (mod ~y$w_buff0_used~0_In1997207448 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite59_Out1997207448| ~y$w_buff0_used~0_In1997207448)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite59_Out1997207448| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1997207448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1997207448} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1997207448, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1997207448, ULTIMATE.start_main_#t~ite59=|ULTIMATE.start_main_#t~ite59_Out1997207448|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite59] because there is no mapped edge [2019-12-27 07:14:49,486 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [935] [935] L823-->L823-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd0~0_In-223177415 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-223177415 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd0~0_In-223177415 256))) (.cse0 (= (mod ~y$w_buff1_used~0_In-223177415 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite60_Out-223177415|)) (and (= ~y$w_buff1_used~0_In-223177415 |ULTIMATE.start_main_#t~ite60_Out-223177415|) (or .cse2 .cse3) (or .cse1 .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-223177415, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-223177415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-223177415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-223177415} OutVars{ULTIMATE.start_main_#t~ite60=|ULTIMATE.start_main_#t~ite60_Out-223177415|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-223177415, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-223177415, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-223177415, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-223177415} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite60] because there is no mapped edge [2019-12-27 07:14:49,487 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [938] [938] L824-->L824-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd0~0_In1114910063 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In1114910063 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite61_Out1114910063| ~y$r_buff0_thd0~0_In1114910063)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite61_Out1114910063| 0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1114910063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1114910063} OutVars{ULTIMATE.start_main_#t~ite61=|ULTIMATE.start_main_#t~ite61_Out1114910063|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1114910063, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1114910063} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite61] because there is no mapped edge [2019-12-27 07:14:49,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [931] [931] L825-->L825-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In-1617656396 256))) (.cse1 (= (mod ~y$r_buff1_thd0~0_In-1617656396 256) 0)) (.cse3 (= 0 (mod ~y$r_buff0_thd0~0_In-1617656396 256))) (.cse2 (= (mod ~y$w_buff0_used~0_In-1617656396 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite62_Out-1617656396| ~y$r_buff1_thd0~0_In-1617656396)) (and (= |ULTIMATE.start_main_#t~ite62_Out-1617656396| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-1617656396, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1617656396, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1617656396, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1617656396} OutVars{ULTIMATE.start_main_#t~ite62=|ULTIMATE.start_main_#t~ite62_Out-1617656396|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1617656396, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-1617656396, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-1617656396, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1617656396} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62] because there is no mapped edge [2019-12-27 07:14:49,488 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [964] [964] L825-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~main$tmp_guard1~0_9 0) (= v_~__unbuffered_p0_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite62_13| v_~y$r_buff1_thd0~0_14) (= 1 v_~__unbuffered_p1_EAX~0_10) (= v_~__unbuffered_p0_EAX~0_8 1) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|) (= 0 v_~__unbuffered_p1_EBX~0_9) (= v_ULTIMATE.start___VERIFIER_assert_~expression_13 0)) InVars {ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_13|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10} OutVars{ULTIMATE.start_main_#t~ite62=|v_ULTIMATE.start_main_#t~ite62_12|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_13, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_9, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_10, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_14, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite62, ULTIMATE.start___VERIFIER_assert_~expression, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 07:14:49,603 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 07:14:49 BasicIcfg [2019-12-27 07:14:49,603 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 07:14:49,605 INFO L168 Benchmark]: Toolchain (without parser) took 76840.20 ms. Allocated memory was 146.3 MB in the beginning and 3.5 GB in the end (delta: 3.4 GB). Free memory was 103.1 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,606 INFO L168 Benchmark]: CDTParser took 0.53 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,607 INFO L168 Benchmark]: CACSL2BoogieTranslator took 822.00 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 155.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,607 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.85 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,609 INFO L168 Benchmark]: Boogie Preprocessor took 43.79 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,610 INFO L168 Benchmark]: RCFGBuilder took 830.68 ms. Allocated memory is still 204.5 MB. Free memory was 150.3 MB in the beginning and 97.4 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,611 INFO L168 Benchmark]: TraceAbstraction took 75068.56 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 96.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 07:14:49,615 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.53 ms. Allocated memory is still 146.3 MB. Free memory was 122.6 MB in the beginning and 122.4 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 822.00 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 102.6 MB in the beginning and 155.8 MB in the end (delta: -53.1 MB). Peak memory consumption was 20.3 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.85 ms. Allocated memory is still 204.5 MB. Free memory was 155.8 MB in the beginning and 153.0 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.79 ms. Allocated memory is still 204.5 MB. Free memory was 153.0 MB in the beginning and 150.3 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 830.68 ms. Allocated memory is still 204.5 MB. Free memory was 150.3 MB in the beginning and 97.4 MB in the end (delta: 52.9 MB). Peak memory consumption was 52.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 75068.56 ms. Allocated memory was 204.5 MB in the beginning and 3.5 GB in the end (delta: 3.3 GB). Free memory was 96.7 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 179 ProgramPointsBefore, 108 ProgramPointsAfterwards, 228 TransitionsBefore, 133 TransitionsAfterwards, 22816 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 29 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 49 ConcurrentYvCompositions, 27 ChoiceCompositions, 8765 VarBasedMoverChecksPositive, 227 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 149863 CheckedPairsTotal, 109 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L813] FCALL, FORK 0 pthread_create(&t1727, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L815] FCALL, FORK 0 pthread_create(&t1728, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L765] 2 y$r_buff1_thd0 = y$r_buff0_thd0 [L766] 2 y$r_buff1_thd1 = y$r_buff0_thd1 [L767] 2 y$r_buff1_thd2 = y$r_buff0_thd2 [L768] 2 y$r_buff0_thd2 = (_Bool)1 [L771] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L772] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L773] 2 y$flush_delayed = weak$$choice2 [L774] 2 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L775] 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] EXPR 2 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L776] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L777] EXPR 2 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L777] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L778] EXPR 2 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L778] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L779] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L779] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L781] EXPR 2 weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L781] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L782] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=1, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L783] 2 y = y$flush_delayed ? y$mem_tmp : y [L784] 2 y$flush_delayed = (_Bool)0 [L787] 2 __unbuffered_p1_EBX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] EXPR 2 y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=3, weak$$choice2=1, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L729] 1 x = 1 [L732] 1 __unbuffered_p0_EAX = x [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 y$flush_delayed = weak$$choice2 [L738] 1 y$mem_tmp = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L739] EXPR 1 !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0] [L790] 2 y = y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd2 ? y$w_buff1 : y) [L791] 2 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used [L792] 2 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd2 || y$w_buff1_used && y$r_buff1_thd2 ? (_Bool)0 : y$w_buff1_used [L739] 1 y = !y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff1) [L740] EXPR 1 weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0))=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L740] 1 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff0 : y$w_buff0)) [L741] EXPR 1 weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L741] 1 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd1 ? y$w_buff1 : y$w_buff1)) [L742] EXPR 1 weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L742] 1 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$w_buff0_used)) [L743] EXPR 1 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L743] 1 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L744] EXPR 1 weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L744] 1 y$r_buff0_thd1 = weak$$choice2 ? y$r_buff0_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff0_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : y$r_buff0_thd1)) [L745] EXPR 1 weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L745] 1 y$r_buff1_thd1 = weak$$choice2 ? y$r_buff1_thd1 : (!y$w_buff0_used || !y$r_buff0_thd1 && !y$w_buff1_used || !y$r_buff0_thd1 && !y$r_buff1_thd1 ? y$r_buff1_thd1 : (y$w_buff0_used && y$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = y VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L817] 0 main$tmp_guard0 = __unbuffered_cnt == 2 VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p1_EAX=1, __unbuffered_p1_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=2, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=1, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0] [L822] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L823] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L824] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 173 locations, 2 error locations. Result: UNSAFE, OverallTime: 74.6s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 18.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 4520 SDtfs, 5052 SDslu, 8660 SDs, 0 SdLazy, 3357 SolverSat, 202 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 127 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=115934occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.3s AutomataMinimizationTime, 18 MinimizatonAttempts, 279007 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 537 NumberOfCodeBlocks, 537 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 459 ConstructedInterpolants, 0 QuantifiedInterpolants, 44943 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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...